./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-15.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-15.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1cf2833edd1cdae0e001cafaa7cd8c6b44382f8b73a263b509a9183609c6c876 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:13:49,459 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:13:49,505 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:13:49,512 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:13:49,512 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:13:49,533 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:13:49,533 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:13:49,534 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:13:49,534 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:13:49,534 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:13:49,534 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:13:49,535 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:13:49,535 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:13:49,535 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:13:49,535 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:13:49,535 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:13:49,536 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:13:49,536 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:13:49,536 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:13:49,536 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:13:49,536 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:13:49,536 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:13:49,536 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:13:49,536 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:13:49,536 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:13:49,536 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:13:49,536 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:13:49,537 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:13:49,537 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:13:49,537 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:13:49,537 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:13:49,537 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:13:49,537 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:13:49,538 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:13:49,538 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:13:49,538 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:13:49,538 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:13:49,538 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:13:49,538 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:13:49,538 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:13:49,538 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:13:49,538 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:13:49,538 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:13:49,538 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1cf2833edd1cdae0e001cafaa7cd8c6b44382f8b73a263b509a9183609c6c876 [2025-03-04 01:13:49,756 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:13:49,765 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:13:49,766 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:13:49,767 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:13:49,767 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:13:49,769 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-15.i [2025-03-04 01:13:50,899 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/208bc75b8/b2b92abf08e24c41b4b1b3ee387abea0/FLAG3b86fe989 [2025-03-04 01:13:51,124 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:13:51,124 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-15.i [2025-03-04 01:13:51,131 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/208bc75b8/b2b92abf08e24c41b4b1b3ee387abea0/FLAG3b86fe989 [2025-03-04 01:13:51,471 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/208bc75b8/b2b92abf08e24c41b4b1b3ee387abea0 [2025-03-04 01:13:51,473 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:13:51,474 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:13:51,475 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:13:51,475 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:13:51,478 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:13:51,478 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:13:51" (1/1) ... [2025-03-04 01:13:51,479 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13ba9601 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:13:51, skipping insertion in model container [2025-03-04 01:13:51,479 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:13:51" (1/1) ... [2025-03-04 01:13:51,494 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:13:51,590 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-15.i[917,930] [2025-03-04 01:13:51,624 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:13:51,632 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:13:51,639 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-15.i[917,930] [2025-03-04 01:13:51,657 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:13:51,669 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:13:51,669 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:13:51 WrapperNode [2025-03-04 01:13:51,669 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:13:51,670 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:13:51,670 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:13:51,670 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:13:51,674 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:13:51" (1/1) ... [2025-03-04 01:13:51,682 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:13:51" (1/1) ... [2025-03-04 01:13:51,708 INFO L138 Inliner]: procedures = 29, calls = 155, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 510 [2025-03-04 01:13:51,709 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:13:51,711 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:13:51,711 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:13:51,711 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:13:51,717 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:13:51" (1/1) ... [2025-03-04 01:13:51,717 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:13:51" (1/1) ... [2025-03-04 01:13:51,722 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:13:51" (1/1) ... [2025-03-04 01:13:51,735 INFO L175 MemorySlicer]: Split 127 memory accesses to 6 slices as follows [2, 16, 51, 25, 10, 23]. 40 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 2, 5, 2, 1, 2]. The 16 writes are split as follows [0, 2, 6, 4, 1, 3]. [2025-03-04 01:13:51,735 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:13:51" (1/1) ... [2025-03-04 01:13:51,735 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:13:51" (1/1) ... [2025-03-04 01:13:51,752 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:13:51" (1/1) ... [2025-03-04 01:13:51,753 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:13:51" (1/1) ... [2025-03-04 01:13:51,759 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:13:51" (1/1) ... [2025-03-04 01:13:51,760 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:13:51" (1/1) ... [2025-03-04 01:13:51,766 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:13:51,770 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:13:51,770 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:13:51,771 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:13:51,771 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:13:51" (1/1) ... [2025-03-04 01:13:51,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:13:51,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:13:51,797 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 01:13:51,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 01:13:51,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:13:51,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-04 01:13:51,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-04 01:13:51,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-04 01:13:51,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-04 01:13:51,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-04 01:13:51,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-03-04 01:13:51,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 01:13:51,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 01:13:51,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 01:13:51,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 01:13:51,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 01:13:51,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 01:13:51,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-04 01:13:51,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-04 01:13:51,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-04 01:13:51,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-04 01:13:51,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-04 01:13:51,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-03-04 01:13:51,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 01:13:51,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 01:13:51,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 01:13:51,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 01:13:51,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 01:13:51,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 01:13:51,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-04 01:13:51,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-04 01:13:51,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-04 01:13:51,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-04 01:13:51,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-04 01:13:51,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-03-04 01:13:51,822 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:13:51,822 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:13:51,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 01:13:51,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 01:13:51,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 01:13:51,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 01:13:51,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 01:13:51,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 01:13:51,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:13:51,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:13:51,961 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:13:51,962 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:13:52,314 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L106: havoc property_#t~mem89#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~short90#1;havoc property_#t~ite101#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~ite98#1;havoc property_#t~mem93#1;havoc property_#t~ite96#1;havoc property_#t~mem95#1;havoc property_#t~mem94#1;havoc property_#t~mem97#1;havoc property_#t~mem100#1;havoc property_#t~mem99#1;havoc property_#t~mem102#1;havoc property_#t~ite112#1;havoc property_#t~mem107#1;havoc property_#t~mem103#1;havoc property_#t~ite106#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~mem111#1;havoc property_#t~mem108#1;havoc property_#t~ite110#1;havoc property_#t~mem109#1;havoc property_#t~short113#1;havoc property_#t~mem114#1;havoc property_#t~ite121#1;havoc property_#t~mem120#1;havoc property_#t~mem119#1;havoc property_#t~mem115#1;havoc property_#t~ite118#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~short122#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~ite140#1;havoc property_#t~mem133#1;havoc property_#t~mem132#1;havoc property_#t~mem125#1;havoc property_#t~mem126#1;havoc property_#t~mem127#1;havoc property_#t~ite131#1;havoc property_#t~mem128#1;havoc property_#t~mem129#1;havoc property_#t~mem130#1;havoc property_#t~mem139#1;havoc property_#t~mem134#1;havoc property_#t~mem135#1;havoc property_#t~ite138#1;havoc property_#t~mem136#1;havoc property_#t~mem137#1;havoc property_#t~short141#1; [2025-03-04 01:13:52,360 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2025-03-04 01:13:52,360 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:13:52,367 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:13:52,368 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:13:52,368 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:13:52 BoogieIcfgContainer [2025-03-04 01:13:52,368 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:13:52,370 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:13:52,370 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:13:52,373 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:13:52,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:13:51" (1/3) ... [2025-03-04 01:13:52,374 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73e3452 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:13:52, skipping insertion in model container [2025-03-04 01:13:52,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:13:51" (2/3) ... [2025-03-04 01:13:52,374 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73e3452 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:13:52, skipping insertion in model container [2025-03-04 01:13:52,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:13:52" (3/3) ... [2025-03-04 01:13:52,375 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-15.i [2025-03-04 01:13:52,385 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:13:52,386 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-ap_file-15.i that has 2 procedures, 112 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:13:52,432 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:13:52,439 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;@2be2e49c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:13:52,439 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:13:52,443 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 97 states have (on average 1.443298969072165) internal successors, (140), 98 states have internal predecessors, (140), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 01:13:52,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-04 01:13:52,452 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:13:52,452 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:13:52,453 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:13:52,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:13:52,458 INFO L85 PathProgramCache]: Analyzing trace with hash -270087371, now seen corresponding path program 1 times [2025-03-04 01:13:52,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:13:52,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420384285] [2025-03-04 01:13:52,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:13:52,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:13:52,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 01:13:52,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 01:13:52,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:13:52,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:13:52,710 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-04 01:13:52,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:13:52,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420384285] [2025-03-04 01:13:52,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420384285] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:13:52,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307849402] [2025-03-04 01:13:52,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:13:52,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:13:52,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:13:52,714 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:13:52,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 01:13:52,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 01:13:52,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 01:13:52,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:13:52,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:13:52,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:13:52,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:13:52,970 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-04 01:13:52,970 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:13:52,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307849402] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:13:52,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:13:52,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:13:52,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922313136] [2025-03-04 01:13:52,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:13:52,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:13:52,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:13:52,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:13:52,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:13:52,995 INFO L87 Difference]: Start difference. First operand has 112 states, 97 states have (on average 1.443298969072165) internal successors, (140), 98 states have internal predecessors, (140), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:13:53,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:13:53,018 INFO L93 Difference]: Finished difference Result 218 states and 335 transitions. [2025-03-04 01:13:53,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:13:53,019 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2025-03-04 01:13:53,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:13:53,024 INFO L225 Difference]: With dead ends: 218 [2025-03-04 01:13:53,024 INFO L226 Difference]: Without dead ends: 109 [2025-03-04 01:13:53,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:13:53,029 INFO L435 NwaCegarLoop]: 157 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, 157 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:13:53,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:13:53,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-04 01:13:53,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-03-04 01:13:53,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 95 states have (on average 1.4) internal successors, (133), 95 states have internal predecessors, (133), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 01:13:53,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 157 transitions. [2025-03-04 01:13:53,060 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 157 transitions. Word has length 115 [2025-03-04 01:13:53,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:13:53,061 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 157 transitions. [2025-03-04 01:13:53,061 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:13:53,061 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 157 transitions. [2025-03-04 01:13:53,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-04 01:13:53,064 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:13:53,064 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:13:53,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 01:13:53,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 01:13:53,265 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:13:53,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:13:53,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1200235572, now seen corresponding path program 1 times [2025-03-04 01:13:53,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:13:53,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561185643] [2025-03-04 01:13:53,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:13:53,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:13:53,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 01:13:53,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 01:13:53,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:13:53,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:13:53,905 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:13:53,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:13:53,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561185643] [2025-03-04 01:13:53,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561185643] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:13:53,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:13:53,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:13:53,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206325958] [2025-03-04 01:13:53,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:13:53,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:13:53,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:13:53,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:13:53,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:13:53,908 INFO L87 Difference]: Start difference. First operand 109 states and 157 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:13:54,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:13:54,083 INFO L93 Difference]: Finished difference Result 322 states and 467 transitions. [2025-03-04 01:13:54,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:13:54,084 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2025-03-04 01:13:54,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:13:54,087 INFO L225 Difference]: With dead ends: 322 [2025-03-04 01:13:54,088 INFO L226 Difference]: Without dead ends: 216 [2025-03-04 01:13:54,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:13:54,089 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 324 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:13:54,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 429 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:13:54,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-03-04 01:13:54,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 212. [2025-03-04 01:13:54,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 185 states have (on average 1.4) internal successors, (259), 185 states have internal predecessors, (259), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 01:13:54,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 307 transitions. [2025-03-04 01:13:54,121 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 307 transitions. Word has length 115 [2025-03-04 01:13:54,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:13:54,122 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 307 transitions. [2025-03-04 01:13:54,122 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:13:54,123 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 307 transitions. [2025-03-04 01:13:54,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-04 01:13:54,124 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:13:54,124 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:13:54,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 01:13:54,125 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:13:54,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:13:54,126 INFO L85 PathProgramCache]: Analyzing trace with hash 495767422, now seen corresponding path program 1 times [2025-03-04 01:13:54,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:13:54,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313160482] [2025-03-04 01:13:54,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:13:54,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:13:54,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 01:13:54,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 01:13:54,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:13:54,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:13:54,551 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:13:54,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:13:54,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313160482] [2025-03-04 01:13:54,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313160482] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:13:54,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:13:54,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:13:54,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993044778] [2025-03-04 01:13:54,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:13:54,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:13:54,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:13:54,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:13:54,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:13:54,554 INFO L87 Difference]: Start difference. First operand 212 states and 307 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:13:54,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:13:54,731 INFO L93 Difference]: Finished difference Result 426 states and 617 transitions. [2025-03-04 01:13:54,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:13:54,731 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2025-03-04 01:13:54,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:13:54,733 INFO L225 Difference]: With dead ends: 426 [2025-03-04 01:13:54,733 INFO L226 Difference]: Without dead ends: 217 [2025-03-04 01:13:54,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:13:54,734 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 228 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:13:54,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 752 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:13:54,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-03-04 01:13:54,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 213. [2025-03-04 01:13:54,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 186 states have (on average 1.39247311827957) internal successors, (259), 186 states have internal predecessors, (259), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 01:13:54,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 307 transitions. [2025-03-04 01:13:54,756 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 307 transitions. Word has length 116 [2025-03-04 01:13:54,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:13:54,757 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 307 transitions. [2025-03-04 01:13:54,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:13:54,758 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 307 transitions. [2025-03-04 01:13:54,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-04 01:13:54,761 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:13:54,761 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:13:54,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 01:13:54,762 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:13:54,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:13:54,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1571966134, now seen corresponding path program 1 times [2025-03-04 01:13:54,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:13:54,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420341343] [2025-03-04 01:13:54,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:13:54,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:13:54,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-04 01:13:54,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-04 01:13:54,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:13:54,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:13:55,282 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:13:55,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:13:55,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420341343] [2025-03-04 01:13:55,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420341343] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:13:55,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:13:55,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:13:55,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719796135] [2025-03-04 01:13:55,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:13:55,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:13:55,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:13:55,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:13:55,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:13:55,286 INFO L87 Difference]: Start difference. First operand 213 states and 307 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 01:13:55,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:13:55,510 INFO L93 Difference]: Finished difference Result 488 states and 703 transitions. [2025-03-04 01:13:55,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:13:55,511 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), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 117 [2025-03-04 01:13:55,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:13:55,513 INFO L225 Difference]: With dead ends: 488 [2025-03-04 01:13:55,513 INFO L226 Difference]: Without dead ends: 380 [2025-03-04 01:13:55,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:13:55,514 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 234 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:13:55,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 814 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:13:55,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2025-03-04 01:13:55,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 376. [2025-03-04 01:13:55,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 331 states have (on average 1.3987915407854985) internal successors, (463), 333 states have internal predecessors, (463), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-04 01:13:55,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 543 transitions. [2025-03-04 01:13:55,556 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 543 transitions. Word has length 117 [2025-03-04 01:13:55,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:13:55,557 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 543 transitions. [2025-03-04 01:13:55,557 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), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 01:13:55,558 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 543 transitions. [2025-03-04 01:13:55,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-04 01:13:55,559 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:13:55,559 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:13:55,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 01:13:55,559 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:13:55,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:13:55,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1857021888, now seen corresponding path program 1 times [2025-03-04 01:13:55,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:13:55,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611579268] [2025-03-04 01:13:55,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:13:55,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:13:55,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-04 01:13:55,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-04 01:13:55,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:13:55,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:13:55,879 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:13:55,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:13:55,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611579268] [2025-03-04 01:13:55,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611579268] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:13:55,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:13:55,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:13:55,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894963624] [2025-03-04 01:13:55,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:13:55,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:13:55,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:13:55,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:13:55,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:13:55,884 INFO L87 Difference]: Start difference. First operand 376 states and 543 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:13:56,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:13:56,044 INFO L93 Difference]: Finished difference Result 770 states and 1113 transitions. [2025-03-04 01:13:56,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:13:56,044 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2025-03-04 01:13:56,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:13:56,050 INFO L225 Difference]: With dead ends: 770 [2025-03-04 01:13:56,050 INFO L226 Difference]: Without dead ends: 579 [2025-03-04 01:13:56,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:13:56,051 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 182 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:13:56,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 866 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:13:56,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2025-03-04 01:13:56,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 559. [2025-03-04 01:13:56,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 492 states have (on average 1.4004065040650406) internal successors, (689), 495 states have internal predecessors, (689), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-04 01:13:56,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 809 transitions. [2025-03-04 01:13:56,111 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 809 transitions. Word has length 118 [2025-03-04 01:13:56,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:13:56,112 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 809 transitions. [2025-03-04 01:13:56,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:13:56,112 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 809 transitions. [2025-03-04 01:13:56,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-04 01:13:56,113 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:13:56,113 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:13:56,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 01:13:56,113 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:13:56,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:13:56,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1448197663, now seen corresponding path program 1 times [2025-03-04 01:13:56,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:13:56,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247330672] [2025-03-04 01:13:56,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:13:56,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:13:56,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-04 01:13:56,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-04 01:13:56,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:13:56,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:13:56,552 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:13:56,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:13:56,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247330672] [2025-03-04 01:13:56,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247330672] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:13:56,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:13:56,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:13:56,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917399734] [2025-03-04 01:13:56,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:13:56,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:13:56,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:13:56,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:13:56,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:13:56,554 INFO L87 Difference]: Start difference. First operand 559 states and 809 transitions. Second operand has 8 states, 7 states have (on average 8.714285714285714) internal successors, (61), 8 states have internal predecessors, (61), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-04 01:13:56,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:13:56,792 INFO L93 Difference]: Finished difference Result 1440 states and 2062 transitions. [2025-03-04 01:13:56,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:13:56,793 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.714285714285714) internal successors, (61), 8 states have internal predecessors, (61), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 118 [2025-03-04 01:13:56,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:13:56,796 INFO L225 Difference]: With dead ends: 1440 [2025-03-04 01:13:56,797 INFO L226 Difference]: Without dead ends: 884 [2025-03-04 01:13:56,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:13:56,799 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 470 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:13:56,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 657 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:13:56,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2025-03-04 01:13:56,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 872. [2025-03-04 01:13:56,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 787 states have (on average 1.3913595933926302) internal successors, (1095), 796 states have internal predecessors, (1095), 72 states have call successors, (72), 12 states have call predecessors, (72), 12 states have return successors, (72), 63 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-04 01:13:56,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1239 transitions. [2025-03-04 01:13:56,867 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1239 transitions. Word has length 118 [2025-03-04 01:13:56,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:13:56,867 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1239 transitions. [2025-03-04 01:13:56,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.714285714285714) internal successors, (61), 8 states have internal predecessors, (61), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-04 01:13:56,868 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1239 transitions. [2025-03-04 01:13:56,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-04 01:13:56,870 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:13:56,870 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:13:56,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 01:13:56,870 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:13:56,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:13:56,871 INFO L85 PathProgramCache]: Analyzing trace with hash 936369783, now seen corresponding path program 1 times [2025-03-04 01:13:56,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:13:56,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803594859] [2025-03-04 01:13:56,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:13:56,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:13:56,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-04 01:13:56,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-04 01:13:56,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:13:56,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:13:57,065 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:13:57,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:13:57,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803594859] [2025-03-04 01:13:57,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803594859] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:13:57,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:13:57,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:13:57,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791615543] [2025-03-04 01:13:57,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:13:57,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:13:57,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:13:57,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:13:57,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:13:57,067 INFO L87 Difference]: Start difference. First operand 872 states and 1239 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:13:57,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:13:57,194 INFO L93 Difference]: Finished difference Result 2149 states and 3048 transitions. [2025-03-04 01:13:57,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:13:57,195 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2025-03-04 01:13:57,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:13:57,202 INFO L225 Difference]: With dead ends: 2149 [2025-03-04 01:13:57,202 INFO L226 Difference]: Without dead ends: 1280 [2025-03-04 01:13:57,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 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-03-04 01:13:57,204 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 114 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:13:57,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 990 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:13:57,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1280 states. [2025-03-04 01:13:57,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1280 to 949. [2025-03-04 01:13:57,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 949 states, 864 states have (on average 1.3888888888888888) internal successors, (1200), 873 states have internal predecessors, (1200), 72 states have call successors, (72), 12 states have call predecessors, (72), 12 states have return successors, (72), 63 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-04 01:13:57,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1344 transitions. [2025-03-04 01:13:57,274 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1344 transitions. Word has length 118 [2025-03-04 01:13:57,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:13:57,276 INFO L471 AbstractCegarLoop]: Abstraction has 949 states and 1344 transitions. [2025-03-04 01:13:57,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:13:57,277 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1344 transitions. [2025-03-04 01:13:57,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-04 01:13:57,281 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:13:57,282 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:13:57,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 01:13:57,282 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:13:57,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:13:57,283 INFO L85 PathProgramCache]: Analyzing trace with hash -856794534, now seen corresponding path program 1 times [2025-03-04 01:13:57,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:13:57,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859066780] [2025-03-04 01:13:57,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:13:57,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:13:57,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-04 01:13:57,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-04 01:13:57,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:13:57,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:13:57,449 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:13:57,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:13:57,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859066780] [2025-03-04 01:13:57,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859066780] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:13:57,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:13:57,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:13:57,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419248804] [2025-03-04 01:13:57,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:13:57,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:13:57,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:13:57,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:13:57,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:13:57,450 INFO L87 Difference]: Start difference. First operand 949 states and 1344 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:13:57,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:13:57,561 INFO L93 Difference]: Finished difference Result 1836 states and 2597 transitions. [2025-03-04 01:13:57,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:13:57,562 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2025-03-04 01:13:57,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:13:57,565 INFO L225 Difference]: With dead ends: 1836 [2025-03-04 01:13:57,566 INFO L226 Difference]: Without dead ends: 890 [2025-03-04 01:13:57,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:13:57,567 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 70 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:13:57,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 740 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:13:57,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2025-03-04 01:13:57,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 888. [2025-03-04 01:13:57,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 888 states, 805 states have (on average 1.3813664596273292) internal successors, (1112), 813 states have internal predecessors, (1112), 70 states have call successors, (70), 12 states have call predecessors, (70), 12 states have return successors, (70), 62 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-04 01:13:57,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1252 transitions. [2025-03-04 01:13:57,620 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1252 transitions. Word has length 118 [2025-03-04 01:13:57,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:13:57,622 INFO L471 AbstractCegarLoop]: Abstraction has 888 states and 1252 transitions. [2025-03-04 01:13:57,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:13:57,622 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1252 transitions. [2025-03-04 01:13:57,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-04 01:13:57,624 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:13:57,624 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:13:57,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 01:13:57,624 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:13:57,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:13:57,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1880686781, now seen corresponding path program 1 times [2025-03-04 01:13:57,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:13:57,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894878363] [2025-03-04 01:13:57,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:13:57,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:13:57,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 01:13:57,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 01:13:57,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:13:57,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:13:57,800 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:13:57,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:13:57,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894878363] [2025-03-04 01:13:57,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894878363] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:13:57,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:13:57,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:13:57,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136008149] [2025-03-04 01:13:57,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:13:57,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:13:57,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:13:57,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:13:57,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:13:57,801 INFO L87 Difference]: Start difference. First operand 888 states and 1252 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:13:57,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:13:57,895 INFO L93 Difference]: Finished difference Result 1773 states and 2498 transitions. [2025-03-04 01:13:57,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:13:57,897 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2025-03-04 01:13:57,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:13:57,904 INFO L225 Difference]: With dead ends: 1773 [2025-03-04 01:13:57,904 INFO L226 Difference]: Without dead ends: 888 [2025-03-04 01:13:57,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:13:57,908 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 69 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:13:57,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 593 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:13:57,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2025-03-04 01:13:57,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 886. [2025-03-04 01:13:57,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 803 states have (on average 1.3760896637608966) internal successors, (1105), 811 states have internal predecessors, (1105), 70 states have call successors, (70), 12 states have call predecessors, (70), 12 states have return successors, (70), 62 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-04 01:13:57,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1245 transitions. [2025-03-04 01:13:57,985 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1245 transitions. Word has length 119 [2025-03-04 01:13:57,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:13:57,986 INFO L471 AbstractCegarLoop]: Abstraction has 886 states and 1245 transitions. [2025-03-04 01:13:57,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:13:57,986 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1245 transitions. [2025-03-04 01:13:57,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-04 01:13:57,987 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:13:57,987 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:13:57,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 01:13:57,988 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:13:57,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:13:57,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1257436247, now seen corresponding path program 1 times [2025-03-04 01:13:57,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:13:57,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964082825] [2025-03-04 01:13:57,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:13:57,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:13:58,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 01:13:58,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 01:13:58,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:13:58,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:13:58,149 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:13:58,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:13:58,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964082825] [2025-03-04 01:13:58,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964082825] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:13:58,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:13:58,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:13:58,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902836812] [2025-03-04 01:13:58,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:13:58,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:13:58,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:13:58,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:13:58,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:13:58,151 INFO L87 Difference]: Start difference. First operand 886 states and 1245 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:13:58,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:13:58,231 INFO L93 Difference]: Finished difference Result 1552 states and 2190 transitions. [2025-03-04 01:13:58,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:13:58,232 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2025-03-04 01:13:58,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:13:58,235 INFO L225 Difference]: With dead ends: 1552 [2025-03-04 01:13:58,235 INFO L226 Difference]: Without dead ends: 669 [2025-03-04 01:13:58,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:13:58,237 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 71 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:13:58,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 747 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:13:58,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2025-03-04 01:13:58,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 659. [2025-03-04 01:13:58,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 585 states have (on average 1.3811965811965812) internal successors, (808), 590 states have internal predecessors, (808), 64 states have call successors, (64), 9 states have call predecessors, (64), 9 states have return successors, (64), 59 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-04 01:13:58,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 936 transitions. [2025-03-04 01:13:58,277 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 936 transitions. Word has length 119 [2025-03-04 01:13:58,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:13:58,277 INFO L471 AbstractCegarLoop]: Abstraction has 659 states and 936 transitions. [2025-03-04 01:13:58,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:13:58,277 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 936 transitions. [2025-03-04 01:13:58,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-04 01:13:58,278 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:13:58,279 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:13:58,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 01:13:58,279 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:13:58,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:13:58,279 INFO L85 PathProgramCache]: Analyzing trace with hash 184557769, now seen corresponding path program 1 times [2025-03-04 01:13:58,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:13:58,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255791253] [2025-03-04 01:13:58,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:13:58,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:13:58,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 01:13:58,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 01:13:58,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:13:58,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:13:58,464 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:13:58,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:13:58,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255791253] [2025-03-04 01:13:58,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255791253] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:13:58,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:13:58,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:13:58,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546928590] [2025-03-04 01:13:58,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:13:58,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:13:58,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:13:58,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:13:58,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:13:58,465 INFO L87 Difference]: Start difference. First operand 659 states and 936 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:13:58,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:13:58,550 INFO L93 Difference]: Finished difference Result 1377 states and 1956 transitions. [2025-03-04 01:13:58,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:13:58,551 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2025-03-04 01:13:58,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:13:58,556 INFO L225 Difference]: With dead ends: 1377 [2025-03-04 01:13:58,556 INFO L226 Difference]: Without dead ends: 920 [2025-03-04 01:13:58,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:13:58,558 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 146 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:13:58,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 803 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:13:58,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2025-03-04 01:13:58,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 910. [2025-03-04 01:13:58,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 910 states, 802 states have (on average 1.3790523690773067) internal successors, (1106), 807 states have internal predecessors, (1106), 94 states have call successors, (94), 13 states have call predecessors, (94), 13 states have return successors, (94), 89 states have call predecessors, (94), 94 states have call successors, (94) [2025-03-04 01:13:58,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1294 transitions. [2025-03-04 01:13:58,614 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1294 transitions. Word has length 119 [2025-03-04 01:13:58,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:13:58,614 INFO L471 AbstractCegarLoop]: Abstraction has 910 states and 1294 transitions. [2025-03-04 01:13:58,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:13:58,615 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1294 transitions. [2025-03-04 01:13:58,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-04 01:13:58,616 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:13:58,616 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:13:58,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 01:13:58,616 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:13:58,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:13:58,617 INFO L85 PathProgramCache]: Analyzing trace with hash -321000856, now seen corresponding path program 1 times [2025-03-04 01:13:58,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:13:58,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526157834] [2025-03-04 01:13:58,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:13:58,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:13:58,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 01:13:58,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 01:13:58,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:13:58,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:13:58,778 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:13:58,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:13:58,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526157834] [2025-03-04 01:13:58,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526157834] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:13:58,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:13:58,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:13:58,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305588586] [2025-03-04 01:13:58,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:13:58,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:13:58,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:13:58,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:13:58,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:13:58,780 INFO L87 Difference]: Start difference. First operand 910 states and 1294 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:13:58,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:13:58,864 INFO L93 Difference]: Finished difference Result 1615 states and 2294 transitions. [2025-03-04 01:13:58,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:13:58,865 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2025-03-04 01:13:58,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:13:58,869 INFO L225 Difference]: With dead ends: 1615 [2025-03-04 01:13:58,869 INFO L226 Difference]: Without dead ends: 910 [2025-03-04 01:13:58,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:13:58,871 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 70 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:13:58,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 571 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:13:58,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2025-03-04 01:13:58,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 908. [2025-03-04 01:13:58,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 800 states have (on average 1.3725) internal successors, (1098), 805 states have internal predecessors, (1098), 94 states have call successors, (94), 13 states have call predecessors, (94), 13 states have return successors, (94), 89 states have call predecessors, (94), 94 states have call successors, (94) [2025-03-04 01:13:58,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1286 transitions. [2025-03-04 01:13:58,920 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1286 transitions. Word has length 119 [2025-03-04 01:13:58,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:13:58,921 INFO L471 AbstractCegarLoop]: Abstraction has 908 states and 1286 transitions. [2025-03-04 01:13:58,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:13:58,921 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1286 transitions. [2025-03-04 01:13:58,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-04 01:13:58,922 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:13:58,922 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:13:58,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 01:13:58,922 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:13:58,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:13:58,922 INFO L85 PathProgramCache]: Analyzing trace with hash -436956178, now seen corresponding path program 1 times [2025-03-04 01:13:58,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:13:58,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005613551] [2025-03-04 01:13:58,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:13:58,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:13:58,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 01:13:58,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 01:13:58,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:13:58,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:13:59,287 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:13:59,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:13:59,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005613551] [2025-03-04 01:13:59,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005613551] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:13:59,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:13:59,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:13:59,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002641046] [2025-03-04 01:13:59,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:13:59,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:13:59,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:13:59,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:13:59,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:13:59,291 INFO L87 Difference]: Start difference. First operand 908 states and 1286 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:13:59,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:13:59,698 INFO L93 Difference]: Finished difference Result 1913 states and 2705 transitions. [2025-03-04 01:13:59,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:13:59,700 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2025-03-04 01:13:59,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:13:59,704 INFO L225 Difference]: With dead ends: 1913 [2025-03-04 01:13:59,704 INFO L226 Difference]: Without dead ends: 1017 [2025-03-04 01:13:59,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:13:59,706 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 404 mSDsluCounter, 1009 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 1240 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:13:59,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 1240 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:13:59,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2025-03-04 01:13:59,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 1006. [2025-03-04 01:13:59,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1006 states, 886 states have (on average 1.3690744920993227) internal successors, (1213), 892 states have internal predecessors, (1213), 104 states have call successors, (104), 15 states have call predecessors, (104), 15 states have return successors, (104), 98 states have call predecessors, (104), 104 states have call successors, (104) [2025-03-04 01:13:59,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 1421 transitions. [2025-03-04 01:13:59,786 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 1421 transitions. Word has length 119 [2025-03-04 01:13:59,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:13:59,786 INFO L471 AbstractCegarLoop]: Abstraction has 1006 states and 1421 transitions. [2025-03-04 01:13:59,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:13:59,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1421 transitions. [2025-03-04 01:13:59,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-04 01:13:59,789 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:13:59,789 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:13:59,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 01:13:59,790 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:13:59,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:13:59,790 INFO L85 PathProgramCache]: Analyzing trace with hash -691692723, now seen corresponding path program 1 times [2025-03-04 01:13:59,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:13:59,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665238367] [2025-03-04 01:13:59,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:13:59,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:13:59,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 01:13:59,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 01:13:59,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:13:59,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:00,398 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:14:00,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:14:00,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665238367] [2025-03-04 01:14:00,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665238367] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:14:00,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:14:00,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 01:14:00,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094242385] [2025-03-04 01:14:00,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:14:00,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 01:14:00,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:14:00,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 01:14:00,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:14:00,400 INFO L87 Difference]: Start difference. First operand 1006 states and 1421 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:14:01,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:14:01,172 INFO L93 Difference]: Finished difference Result 2130 states and 3009 transitions. [2025-03-04 01:14:01,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:14:01,172 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2025-03-04 01:14:01,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:14:01,177 INFO L225 Difference]: With dead ends: 2130 [2025-03-04 01:14:01,177 INFO L226 Difference]: Without dead ends: 1136 [2025-03-04 01:14:01,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2025-03-04 01:14:01,179 INFO L435 NwaCegarLoop]: 314 mSDtfsCounter, 434 mSDsluCounter, 1823 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 2137 SdHoareTripleChecker+Invalid, 721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:14:01,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 2137 Invalid, 721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:14:01,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2025-03-04 01:14:01,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 1033. [2025-03-04 01:14:01,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1033 states, 904 states have (on average 1.3672566371681416) internal successors, (1236), 910 states have internal predecessors, (1236), 112 states have call successors, (112), 16 states have call predecessors, (112), 16 states have return successors, (112), 106 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-04 01:14:01,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1460 transitions. [2025-03-04 01:14:01,227 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1460 transitions. Word has length 119 [2025-03-04 01:14:01,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:14:01,227 INFO L471 AbstractCegarLoop]: Abstraction has 1033 states and 1460 transitions. [2025-03-04 01:14:01,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:14:01,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1460 transitions. [2025-03-04 01:14:01,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-04 01:14:01,228 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:14:01,229 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:14:01,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 01:14:01,229 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:14:01,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:14:01,229 INFO L85 PathProgramCache]: Analyzing trace with hash 384211349, now seen corresponding path program 1 times [2025-03-04 01:14:01,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:14:01,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689159122] [2025-03-04 01:14:01,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:01,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:14:01,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-04 01:14:01,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-04 01:14:01,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:01,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:01,523 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:14:01,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:14:01,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689159122] [2025-03-04 01:14:01,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689159122] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:14:01,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:14:01,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:14:01,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932534413] [2025-03-04 01:14:01,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:14:01,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:14:01,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:14:01,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:14:01,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:14:01,526 INFO L87 Difference]: Start difference. First operand 1033 states and 1460 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:14:01,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:14:01,833 INFO L93 Difference]: Finished difference Result 2115 states and 2982 transitions. [2025-03-04 01:14:01,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:14:01,834 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 120 [2025-03-04 01:14:01,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:14:01,839 INFO L225 Difference]: With dead ends: 2115 [2025-03-04 01:14:01,839 INFO L226 Difference]: Without dead ends: 1130 [2025-03-04 01:14:01,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:14:01,841 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 380 mSDsluCounter, 803 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 1033 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:14:01,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 1033 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:14:01,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2025-03-04 01:14:01,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 1043. [2025-03-04 01:14:01,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1043 states, 914 states have (on average 1.3676148796498906) internal successors, (1250), 920 states have internal predecessors, (1250), 112 states have call successors, (112), 16 states have call predecessors, (112), 16 states have return successors, (112), 106 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-04 01:14:01,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1474 transitions. [2025-03-04 01:14:01,891 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1474 transitions. Word has length 120 [2025-03-04 01:14:01,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:14:01,892 INFO L471 AbstractCegarLoop]: Abstraction has 1043 states and 1474 transitions. [2025-03-04 01:14:01,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:14:01,893 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1474 transitions. [2025-03-04 01:14:01,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-04 01:14:01,894 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:14:01,894 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:14:01,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 01:14:01,894 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:14:01,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:14:01,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1077313046, now seen corresponding path program 1 times [2025-03-04 01:14:01,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:14:01,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637231612] [2025-03-04 01:14:01,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:01,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:14:01,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-04 01:14:01,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-04 01:14:01,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:01,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:02,430 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:14:02,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:14:02,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637231612] [2025-03-04 01:14:02,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637231612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:14:02,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:14:02,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 01:14:02,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323827259] [2025-03-04 01:14:02,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:14:02,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 01:14:02,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:14:02,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 01:14:02,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:14:02,432 INFO L87 Difference]: Start difference. First operand 1043 states and 1474 transitions. Second operand has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:14:03,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:14:03,166 INFO L93 Difference]: Finished difference Result 2045 states and 2883 transitions. [2025-03-04 01:14:03,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:14:03,166 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 120 [2025-03-04 01:14:03,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:14:03,171 INFO L225 Difference]: With dead ends: 2045 [2025-03-04 01:14:03,171 INFO L226 Difference]: Without dead ends: 1050 [2025-03-04 01:14:03,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2025-03-04 01:14:03,174 INFO L435 NwaCegarLoop]: 317 mSDtfsCounter, 494 mSDsluCounter, 1793 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 2110 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:14:03,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 2110 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:14:03,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1050 states. [2025-03-04 01:14:03,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1050 to 1028. [2025-03-04 01:14:03,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1028 states, 899 states have (on average 1.3659621802002224) internal successors, (1228), 905 states have internal predecessors, (1228), 112 states have call successors, (112), 16 states have call predecessors, (112), 16 states have return successors, (112), 106 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-04 01:14:03,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1452 transitions. [2025-03-04 01:14:03,226 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1452 transitions. Word has length 120 [2025-03-04 01:14:03,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:14:03,226 INFO L471 AbstractCegarLoop]: Abstraction has 1028 states and 1452 transitions. [2025-03-04 01:14:03,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:14:03,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1452 transitions. [2025-03-04 01:14:03,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-04 01:14:03,227 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:14:03,227 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:14:03,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 01:14:03,228 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:14:03,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:14:03,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1206848473, now seen corresponding path program 1 times [2025-03-04 01:14:03,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:14:03,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358438898] [2025-03-04 01:14:03,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:03,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:14:03,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 01:14:03,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 01:14:03,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:03,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:03,858 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:14:03,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:14:03,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358438898] [2025-03-04 01:14:03,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358438898] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:14:03,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:14:03,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 01:14:03,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871580452] [2025-03-04 01:14:03,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:14:03,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 01:14:03,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:14:03,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 01:14:03,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:14:03,859 INFO L87 Difference]: Start difference. First operand 1028 states and 1452 transitions. Second operand has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:14:04,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:14:04,825 INFO L93 Difference]: Finished difference Result 2010 states and 2831 transitions. [2025-03-04 01:14:04,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:14:04,825 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 121 [2025-03-04 01:14:04,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:14:04,831 INFO L225 Difference]: With dead ends: 2010 [2025-03-04 01:14:04,831 INFO L226 Difference]: Without dead ends: 1307 [2025-03-04 01:14:04,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2025-03-04 01:14:04,835 INFO L435 NwaCegarLoop]: 354 mSDtfsCounter, 435 mSDsluCounter, 1697 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 2051 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:14:04,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 2051 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 01:14:04,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1307 states. [2025-03-04 01:14:04,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1307 to 1301. [2025-03-04 01:14:04,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1301 states, 1137 states have (on average 1.3632365875109937) internal successors, (1550), 1146 states have internal predecessors, (1550), 140 states have call successors, (140), 23 states have call predecessors, (140), 23 states have return successors, (140), 131 states have call predecessors, (140), 140 states have call successors, (140) [2025-03-04 01:14:04,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1301 states to 1301 states and 1830 transitions. [2025-03-04 01:14:04,902 INFO L78 Accepts]: Start accepts. Automaton has 1301 states and 1830 transitions. Word has length 121 [2025-03-04 01:14:04,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:14:04,902 INFO L471 AbstractCegarLoop]: Abstraction has 1301 states and 1830 transitions. [2025-03-04 01:14:04,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:14:04,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1301 states and 1830 transitions. [2025-03-04 01:14:04,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-04 01:14:04,903 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:14:04,904 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:14:04,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 01:14:04,904 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:14:04,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:14:04,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1175828666, now seen corresponding path program 1 times [2025-03-04 01:14:04,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:14:04,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658932735] [2025-03-04 01:14:04,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:04,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:14:04,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 01:14:04,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 01:14:04,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:04,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:05,495 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:14:05,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:14:05,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658932735] [2025-03-04 01:14:05,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658932735] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:14:05,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:14:05,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 01:14:05,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474132400] [2025-03-04 01:14:05,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:14:05,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 01:14:05,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:14:05,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 01:14:05,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:14:05,497 INFO L87 Difference]: Start difference. First operand 1301 states and 1830 transitions. Second operand has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:14:06,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:14:06,398 INFO L93 Difference]: Finished difference Result 2369 states and 3323 transitions. [2025-03-04 01:14:06,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:14:06,399 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 121 [2025-03-04 01:14:06,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:14:06,421 INFO L225 Difference]: With dead ends: 2369 [2025-03-04 01:14:06,422 INFO L226 Difference]: Without dead ends: 1393 [2025-03-04 01:14:06,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2025-03-04 01:14:06,424 INFO L435 NwaCegarLoop]: 356 mSDtfsCounter, 433 mSDsluCounter, 1823 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 2179 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:14:06,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 2179 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 719 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 01:14:06,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2025-03-04 01:14:06,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 1114. [2025-03-04 01:14:06,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1114 states, 971 states have (on average 1.361483007209063) internal successors, (1322), 978 states have internal predecessors, (1322), 122 states have call successors, (122), 20 states have call predecessors, (122), 20 states have return successors, (122), 115 states have call predecessors, (122), 122 states have call successors, (122) [2025-03-04 01:14:06,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1114 states to 1114 states and 1566 transitions. [2025-03-04 01:14:06,517 INFO L78 Accepts]: Start accepts. Automaton has 1114 states and 1566 transitions. Word has length 121 [2025-03-04 01:14:06,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:14:06,517 INFO L471 AbstractCegarLoop]: Abstraction has 1114 states and 1566 transitions. [2025-03-04 01:14:06,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:14:06,518 INFO L276 IsEmpty]: Start isEmpty. Operand 1114 states and 1566 transitions. [2025-03-04 01:14:06,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-04 01:14:06,519 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:14:06,519 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:14:06,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 01:14:06,519 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:14:06,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:14:06,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1863048527, now seen corresponding path program 1 times [2025-03-04 01:14:06,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:14:06,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071725017] [2025-03-04 01:14:06,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:06,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:14:06,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 01:14:06,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 01:14:06,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:06,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:06,803 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:14:06,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:14:06,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071725017] [2025-03-04 01:14:06,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071725017] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:14:06,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:14:06,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:14:06,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923452470] [2025-03-04 01:14:06,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:14:06,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:14:06,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:14:06,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:14:06,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:14:06,805 INFO L87 Difference]: Start difference. First operand 1114 states and 1566 transitions. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 01:14:07,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:14:07,109 INFO L93 Difference]: Finished difference Result 2363 states and 3317 transitions. [2025-03-04 01:14:07,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 01:14:07,109 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 121 [2025-03-04 01:14:07,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:14:07,115 INFO L225 Difference]: With dead ends: 2363 [2025-03-04 01:14:07,115 INFO L226 Difference]: Without dead ends: 1297 [2025-03-04 01:14:07,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2025-03-04 01:14:07,117 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 226 mSDsluCounter, 1056 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 1300 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:14:07,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 1300 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:14:07,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1297 states. [2025-03-04 01:14:07,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1297 to 1136. [2025-03-04 01:14:07,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1136 states, 993 states have (on average 1.353474320241692) internal successors, (1344), 1000 states have internal predecessors, (1344), 122 states have call successors, (122), 20 states have call predecessors, (122), 20 states have return successors, (122), 115 states have call predecessors, (122), 122 states have call successors, (122) [2025-03-04 01:14:07,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1136 states to 1136 states and 1588 transitions. [2025-03-04 01:14:07,177 INFO L78 Accepts]: Start accepts. Automaton has 1136 states and 1588 transitions. Word has length 121 [2025-03-04 01:14:07,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:14:07,177 INFO L471 AbstractCegarLoop]: Abstraction has 1136 states and 1588 transitions. [2025-03-04 01:14:07,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 01:14:07,177 INFO L276 IsEmpty]: Start isEmpty. Operand 1136 states and 1588 transitions. [2025-03-04 01:14:07,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-04 01:14:07,178 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:14:07,179 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:14:07,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 01:14:07,179 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:14:07,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:14:07,179 INFO L85 PathProgramCache]: Analyzing trace with hash -175007762, now seen corresponding path program 1 times [2025-03-04 01:14:07,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:14:07,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128682441] [2025-03-04 01:14:07,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:07,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:14:07,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 01:14:07,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 01:14:07,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:07,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:07,484 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:14:07,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:14:07,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128682441] [2025-03-04 01:14:07,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128682441] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:14:07,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:14:07,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:14:07,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197554155] [2025-03-04 01:14:07,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:14:07,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:14:07,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:14:07,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:14:07,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:14:07,486 INFO L87 Difference]: Start difference. First operand 1136 states and 1588 transitions. Second operand has 7 states, 6 states have (on average 10.666666666666666) internal successors, (64), 7 states have internal predecessors, (64), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 01:14:07,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:14:07,670 INFO L93 Difference]: Finished difference Result 2216 states and 3096 transitions. [2025-03-04 01:14:07,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:14:07,671 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.666666666666666) internal successors, (64), 7 states have internal predecessors, (64), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 121 [2025-03-04 01:14:07,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:14:07,675 INFO L225 Difference]: With dead ends: 2216 [2025-03-04 01:14:07,675 INFO L226 Difference]: Without dead ends: 1128 [2025-03-04 01:14:07,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:14:07,677 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 200 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:14:07,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 845 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:14:07,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2025-03-04 01:14:07,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 1126. [2025-03-04 01:14:07,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1126 states, 983 states have (on average 1.3509664292980672) internal successors, (1328), 990 states have internal predecessors, (1328), 122 states have call successors, (122), 20 states have call predecessors, (122), 20 states have return successors, (122), 115 states have call predecessors, (122), 122 states have call successors, (122) [2025-03-04 01:14:07,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 1126 states and 1572 transitions. [2025-03-04 01:14:07,735 INFO L78 Accepts]: Start accepts. Automaton has 1126 states and 1572 transitions. Word has length 121 [2025-03-04 01:14:07,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:14:07,735 INFO L471 AbstractCegarLoop]: Abstraction has 1126 states and 1572 transitions. [2025-03-04 01:14:07,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.666666666666666) internal successors, (64), 7 states have internal predecessors, (64), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 01:14:07,736 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1572 transitions. [2025-03-04 01:14:07,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-04 01:14:07,737 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:14:07,737 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:14:07,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 01:14:07,737 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:14:07,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:14:07,737 INFO L85 PathProgramCache]: Analyzing trace with hash 269267994, now seen corresponding path program 1 times [2025-03-04 01:14:07,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:14:07,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173888722] [2025-03-04 01:14:07,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:07,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:14:07,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 01:14:07,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 01:14:07,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:07,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:08,281 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:14:08,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:14:08,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173888722] [2025-03-04 01:14:08,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173888722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:14:08,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:14:08,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 01:14:08,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845164154] [2025-03-04 01:14:08,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:14:08,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 01:14:08,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:14:08,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 01:14:08,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:14:08,284 INFO L87 Difference]: Start difference. First operand 1126 states and 1572 transitions. Second operand has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:14:09,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:14:09,947 INFO L93 Difference]: Finished difference Result 2206 states and 3066 transitions. [2025-03-04 01:14:09,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 01:14:09,948 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 122 [2025-03-04 01:14:09,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:14:09,954 INFO L225 Difference]: With dead ends: 2206 [2025-03-04 01:14:09,954 INFO L226 Difference]: Without dead ends: 1405 [2025-03-04 01:14:09,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2025-03-04 01:14:09,957 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 599 mSDsluCounter, 1283 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 599 SdHoareTripleChecker+Valid, 1528 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:14:09,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [599 Valid, 1528 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-04 01:14:09,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2025-03-04 01:14:10,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 1145. [2025-03-04 01:14:10,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1145 states, 1001 states have (on average 1.3486513486513487) internal successors, (1350), 1008 states have internal predecessors, (1350), 122 states have call successors, (122), 21 states have call predecessors, (122), 21 states have return successors, (122), 115 states have call predecessors, (122), 122 states have call successors, (122) [2025-03-04 01:14:10,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 1594 transitions. [2025-03-04 01:14:10,040 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 1594 transitions. Word has length 122 [2025-03-04 01:14:10,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:14:10,040 INFO L471 AbstractCegarLoop]: Abstraction has 1145 states and 1594 transitions. [2025-03-04 01:14:10,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:14:10,040 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 1594 transitions. [2025-03-04 01:14:10,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-04 01:14:10,042 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:14:10,042 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:14:10,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 01:14:10,042 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:14:10,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:14:10,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1230882011, now seen corresponding path program 1 times [2025-03-04 01:14:10,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:14:10,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025550318] [2025-03-04 01:14:10,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:10,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:14:10,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 01:14:10,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 01:14:10,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:10,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:10,577 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:14:10,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:14:10,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025550318] [2025-03-04 01:14:10,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025550318] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:14:10,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:14:10,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 01:14:10,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797547999] [2025-03-04 01:14:10,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:14:10,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 01:14:10,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:14:10,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 01:14:10,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:14:10,579 INFO L87 Difference]: Start difference. First operand 1145 states and 1594 transitions. Second operand has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:14:11,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:14:11,709 INFO L93 Difference]: Finished difference Result 2215 states and 3076 transitions. [2025-03-04 01:14:11,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 01:14:11,709 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 122 [2025-03-04 01:14:11,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:14:11,715 INFO L225 Difference]: With dead ends: 2215 [2025-03-04 01:14:11,715 INFO L226 Difference]: Without dead ends: 1399 [2025-03-04 01:14:11,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2025-03-04 01:14:11,720 INFO L435 NwaCegarLoop]: 247 mSDtfsCounter, 595 mSDsluCounter, 1289 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 595 SdHoareTripleChecker+Valid, 1536 SdHoareTripleChecker+Invalid, 751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 01:14:11,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [595 Valid, 1536 Invalid, 751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 01:14:11,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2025-03-04 01:14:11,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 1124. [2025-03-04 01:14:11,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1124 states, 980 states have (on average 1.3489795918367347) internal successors, (1322), 987 states have internal predecessors, (1322), 122 states have call successors, (122), 21 states have call predecessors, (122), 21 states have return successors, (122), 115 states have call predecessors, (122), 122 states have call successors, (122) [2025-03-04 01:14:11,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1566 transitions. [2025-03-04 01:14:11,812 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1566 transitions. Word has length 122 [2025-03-04 01:14:11,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:14:11,812 INFO L471 AbstractCegarLoop]: Abstraction has 1124 states and 1566 transitions. [2025-03-04 01:14:11,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:14:11,813 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1566 transitions. [2025-03-04 01:14:11,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-04 01:14:11,815 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:14:11,815 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:14:11,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 01:14:11,815 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:14:11,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:14:11,816 INFO L85 PathProgramCache]: Analyzing trace with hash -142561680, now seen corresponding path program 1 times [2025-03-04 01:14:11,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:14:11,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813433689] [2025-03-04 01:14:11,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:11,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:14:11,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 01:14:11,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 01:14:11,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:11,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:12,055 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:14:12,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:14:12,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813433689] [2025-03-04 01:14:12,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813433689] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:14:12,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:14:12,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:14:12,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524018633] [2025-03-04 01:14:12,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:14:12,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:14:12,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:14:12,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:14:12,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:14:12,056 INFO L87 Difference]: Start difference. First operand 1124 states and 1566 transitions. Second operand has 8 states, 7 states have (on average 9.285714285714286) internal successors, (65), 8 states have internal predecessors, (65), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-04 01:14:12,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:14:12,256 INFO L93 Difference]: Finished difference Result 2214 states and 3069 transitions. [2025-03-04 01:14:12,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:14:12,257 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.285714285714286) internal successors, (65), 8 states have internal predecessors, (65), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 122 [2025-03-04 01:14:12,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:14:12,263 INFO L225 Difference]: With dead ends: 2214 [2025-03-04 01:14:12,264 INFO L226 Difference]: Without dead ends: 1142 [2025-03-04 01:14:12,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:14:12,266 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 500 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:14:12,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 524 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:14:12,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2025-03-04 01:14:12,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 1091. [2025-03-04 01:14:12,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1091 states, 951 states have (on average 1.3385909568874867) internal successors, (1273), 957 states have internal predecessors, (1273), 112 states have call successors, (112), 27 states have call predecessors, (112), 27 states have return successors, (112), 106 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-04 01:14:12,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 1091 states and 1497 transitions. [2025-03-04 01:14:12,359 INFO L78 Accepts]: Start accepts. Automaton has 1091 states and 1497 transitions. Word has length 122 [2025-03-04 01:14:12,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:14:12,359 INFO L471 AbstractCegarLoop]: Abstraction has 1091 states and 1497 transitions. [2025-03-04 01:14:12,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.285714285714286) internal successors, (65), 8 states have internal predecessors, (65), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-04 01:14:12,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1091 states and 1497 transitions. [2025-03-04 01:14:12,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-04 01:14:12,360 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:14:12,360 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:14:12,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 01:14:12,361 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:14:12,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:14:12,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1508171605, now seen corresponding path program 1 times [2025-03-04 01:14:12,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:14:12,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403825358] [2025-03-04 01:14:12,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:12,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:14:12,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 01:14:12,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 01:14:12,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:12,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:12,694 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:14:12,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:14:12,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403825358] [2025-03-04 01:14:12,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403825358] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:14:12,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:14:12,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 01:14:12,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467538384] [2025-03-04 01:14:12,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:14:12,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 01:14:12,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:14:12,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 01:14:12,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:14:12,695 INFO L87 Difference]: Start difference. First operand 1091 states and 1497 transitions. Second operand has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:14:13,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:14:13,082 INFO L93 Difference]: Finished difference Result 2407 states and 3292 transitions. [2025-03-04 01:14:13,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 01:14:13,083 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2025-03-04 01:14:13,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:14:13,088 INFO L225 Difference]: With dead ends: 2407 [2025-03-04 01:14:13,088 INFO L226 Difference]: Without dead ends: 1319 [2025-03-04 01:14:13,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2025-03-04 01:14:13,091 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 428 mSDsluCounter, 1504 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 1707 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:14:13,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 1707 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:14:13,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2025-03-04 01:14:13,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1110. [2025-03-04 01:14:13,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1110 states, 970 states have (on average 1.3371134020618556) internal successors, (1297), 976 states have internal predecessors, (1297), 112 states have call successors, (112), 27 states have call predecessors, (112), 27 states have return successors, (112), 106 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-04 01:14:13,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1521 transitions. [2025-03-04 01:14:13,177 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1521 transitions. Word has length 122 [2025-03-04 01:14:13,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:14:13,177 INFO L471 AbstractCegarLoop]: Abstraction has 1110 states and 1521 transitions. [2025-03-04 01:14:13,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:14:13,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1521 transitions. [2025-03-04 01:14:13,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-04 01:14:13,178 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:14:13,179 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:14:13,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 01:14:13,179 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:14:13,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:14:13,179 INFO L85 PathProgramCache]: Analyzing trace with hash 989844332, now seen corresponding path program 1 times [2025-03-04 01:14:13,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:14:13,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151914152] [2025-03-04 01:14:13,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:13,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:14:13,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 01:14:13,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 01:14:13,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:13,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:13,543 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:14:13,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:14:13,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151914152] [2025-03-04 01:14:13,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151914152] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:14:13,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:14:13,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:14:13,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710572273] [2025-03-04 01:14:13,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:14:13,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:14:13,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:14:13,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:14:13,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:14:13,545 INFO L87 Difference]: Start difference. First operand 1110 states and 1521 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:14:13,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:14:13,879 INFO L93 Difference]: Finished difference Result 2370 states and 3239 transitions. [2025-03-04 01:14:13,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:14:13,879 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2025-03-04 01:14:13,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:14:13,884 INFO L225 Difference]: With dead ends: 2370 [2025-03-04 01:14:13,884 INFO L226 Difference]: Without dead ends: 1263 [2025-03-04 01:14:13,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:14:13,886 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 369 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:14:13,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 882 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:14:13,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1263 states. [2025-03-04 01:14:13,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1263 to 1110. [2025-03-04 01:14:13,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1110 states, 970 states have (on average 1.336082474226804) internal successors, (1296), 976 states have internal predecessors, (1296), 112 states have call successors, (112), 27 states have call predecessors, (112), 27 states have return successors, (112), 106 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-04 01:14:13,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1520 transitions. [2025-03-04 01:14:13,964 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1520 transitions. Word has length 122 [2025-03-04 01:14:13,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:14:13,964 INFO L471 AbstractCegarLoop]: Abstraction has 1110 states and 1520 transitions. [2025-03-04 01:14:13,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:14:13,965 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1520 transitions. [2025-03-04 01:14:13,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-04 01:14:13,967 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:14:13,967 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:14:13,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 01:14:13,967 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:14:13,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:14:13,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1157371668, now seen corresponding path program 1 times [2025-03-04 01:14:13,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:14:13,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998741487] [2025-03-04 01:14:13,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:13,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:14:13,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 01:14:13,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 01:14:13,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:13,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:14,265 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:14:14,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:14:14,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998741487] [2025-03-04 01:14:14,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998741487] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:14:14,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:14:14,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:14:14,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122786584] [2025-03-04 01:14:14,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:14:14,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:14:14,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:14:14,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:14:14,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:14:14,268 INFO L87 Difference]: Start difference. First operand 1110 states and 1520 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:14:14,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:14:14,767 INFO L93 Difference]: Finished difference Result 2471 states and 3377 transitions. [2025-03-04 01:14:14,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:14:14,768 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2025-03-04 01:14:14,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:14:14,773 INFO L225 Difference]: With dead ends: 2471 [2025-03-04 01:14:14,773 INFO L226 Difference]: Without dead ends: 1364 [2025-03-04 01:14:14,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:14:14,776 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 405 mSDsluCounter, 873 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 1100 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:14:14,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 1100 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:14:14,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2025-03-04 01:14:14,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1110. [2025-03-04 01:14:14,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1110 states, 970 states have (on average 1.3329896907216494) internal successors, (1293), 976 states have internal predecessors, (1293), 112 states have call successors, (112), 27 states have call predecessors, (112), 27 states have return successors, (112), 106 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-04 01:14:14,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1517 transitions. [2025-03-04 01:14:14,859 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1517 transitions. Word has length 122 [2025-03-04 01:14:14,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:14:14,860 INFO L471 AbstractCegarLoop]: Abstraction has 1110 states and 1517 transitions. [2025-03-04 01:14:14,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:14:14,860 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1517 transitions. [2025-03-04 01:14:14,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-04 01:14:14,861 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:14:14,861 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:14:14,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 01:14:14,862 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:14:14,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:14:14,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1340644269, now seen corresponding path program 1 times [2025-03-04 01:14:14,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:14:14,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232628030] [2025-03-04 01:14:14,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:14,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:14:14,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 01:14:14,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 01:14:14,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:14,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:15,407 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:14:15,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:14:15,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232628030] [2025-03-04 01:14:15,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232628030] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:14:15,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:14:15,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 01:14:15,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274723160] [2025-03-04 01:14:15,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:14:15,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 01:14:15,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:14:15,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 01:14:15,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:14:15,409 INFO L87 Difference]: Start difference. First operand 1110 states and 1517 transitions. Second operand has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:14:16,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:14:16,166 INFO L93 Difference]: Finished difference Result 2471 states and 3371 transitions. [2025-03-04 01:14:16,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 01:14:16,166 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2025-03-04 01:14:16,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:14:16,174 INFO L225 Difference]: With dead ends: 2471 [2025-03-04 01:14:16,177 INFO L226 Difference]: Without dead ends: 1364 [2025-03-04 01:14:16,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2025-03-04 01:14:16,180 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 348 mSDsluCounter, 1996 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 2255 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:14:16,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 2255 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:14:16,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2025-03-04 01:14:16,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1106. [2025-03-04 01:14:16,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1106 states, 966 states have (on average 1.3312629399585922) internal successors, (1286), 972 states have internal predecessors, (1286), 112 states have call successors, (112), 27 states have call predecessors, (112), 27 states have return successors, (112), 106 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-04 01:14:16,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1510 transitions. [2025-03-04 01:14:16,285 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 1510 transitions. Word has length 122 [2025-03-04 01:14:16,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:14:16,286 INFO L471 AbstractCegarLoop]: Abstraction has 1106 states and 1510 transitions. [2025-03-04 01:14:16,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:14:16,286 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1510 transitions. [2025-03-04 01:14:16,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-04 01:14:16,287 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:14:16,287 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:14:16,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-04 01:14:16,287 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:14:16,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:14:16,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1066023861, now seen corresponding path program 1 times [2025-03-04 01:14:16,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:14:16,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883160899] [2025-03-04 01:14:16,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:16,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:14:16,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 01:14:16,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 01:14:16,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:16,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:16,678 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:14:16,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:14:16,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883160899] [2025-03-04 01:14:16,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883160899] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:14:16,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:14:16,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 01:14:16,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004146052] [2025-03-04 01:14:16,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:14:16,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 01:14:16,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:14:16,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 01:14:16,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:14:16,680 INFO L87 Difference]: Start difference. First operand 1106 states and 1510 transitions. Second operand has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:14:17,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:14:17,033 INFO L93 Difference]: Finished difference Result 1922 states and 2632 transitions. [2025-03-04 01:14:17,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 01:14:17,033 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 124 [2025-03-04 01:14:17,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:14:17,054 INFO L225 Difference]: With dead ends: 1922 [2025-03-04 01:14:17,054 INFO L226 Difference]: Without dead ends: 1117 [2025-03-04 01:14:17,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2025-03-04 01:14:17,055 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 186 mSDsluCounter, 1088 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 1260 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:14:17,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 1260 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:14:17,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2025-03-04 01:14:17,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 1115. [2025-03-04 01:14:17,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1115 states, 975 states have (on average 1.3282051282051281) internal successors, (1295), 981 states have internal predecessors, (1295), 112 states have call successors, (112), 27 states have call predecessors, (112), 27 states have return successors, (112), 106 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-04 01:14:17,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1519 transitions. [2025-03-04 01:14:17,136 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1519 transitions. Word has length 124 [2025-03-04 01:14:17,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:14:17,137 INFO L471 AbstractCegarLoop]: Abstraction has 1115 states and 1519 transitions. [2025-03-04 01:14:17,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:14:17,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1519 transitions. [2025-03-04 01:14:17,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-04 01:14:17,138 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:14:17,138 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:14:17,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-04 01:14:17,138 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:14:17,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:14:17,139 INFO L85 PathProgramCache]: Analyzing trace with hash -299586064, now seen corresponding path program 1 times [2025-03-04 01:14:17,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:14:17,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358857798] [2025-03-04 01:14:17,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:17,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:14:17,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 01:14:17,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 01:14:17,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:17,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:17,348 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:14:17,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:14:17,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358857798] [2025-03-04 01:14:17,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358857798] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:14:17,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:14:17,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:14:17,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742106037] [2025-03-04 01:14:17,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:14:17,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:14:17,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:14:17,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:14:17,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:14:17,350 INFO L87 Difference]: Start difference. First operand 1115 states and 1519 transitions. Second operand has 8 states, 7 states have (on average 9.571428571428571) internal successors, (67), 8 states have internal predecessors, (67), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-04 01:14:17,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:14:17,708 INFO L93 Difference]: Finished difference Result 1926 states and 2628 transitions. [2025-03-04 01:14:17,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:14:17,709 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.571428571428571) internal successors, (67), 8 states have internal predecessors, (67), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 124 [2025-03-04 01:14:17,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:14:17,713 INFO L225 Difference]: With dead ends: 1926 [2025-03-04 01:14:17,713 INFO L226 Difference]: Without dead ends: 1112 [2025-03-04 01:14:17,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:14:17,715 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 204 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:14:17,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 808 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:14:17,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1112 states. [2025-03-04 01:14:17,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1112 to 1100. [2025-03-04 01:14:17,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1100 states, 960 states have (on average 1.3239583333333333) internal successors, (1271), 966 states have internal predecessors, (1271), 112 states have call successors, (112), 27 states have call predecessors, (112), 27 states have return successors, (112), 106 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-04 01:14:17,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1100 states to 1100 states and 1495 transitions. [2025-03-04 01:14:17,897 INFO L78 Accepts]: Start accepts. Automaton has 1100 states and 1495 transitions. Word has length 124 [2025-03-04 01:14:17,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:14:17,898 INFO L471 AbstractCegarLoop]: Abstraction has 1100 states and 1495 transitions. [2025-03-04 01:14:17,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.571428571428571) internal successors, (67), 8 states have internal predecessors, (67), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-04 01:14:17,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1100 states and 1495 transitions. [2025-03-04 01:14:17,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-04 01:14:17,900 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:14:17,900 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:14:17,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-04 01:14:17,900 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:14:17,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:14:17,901 INFO L85 PathProgramCache]: Analyzing trace with hash -437880411, now seen corresponding path program 1 times [2025-03-04 01:14:17,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:14:17,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181971547] [2025-03-04 01:14:17,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:17,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:14:17,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 01:14:17,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 01:14:17,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:17,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:18,010 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-04 01:14:18,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:14:18,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181971547] [2025-03-04 01:14:18,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181971547] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:14:18,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870344671] [2025-03-04 01:14:18,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:18,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:14:18,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:14:18,013 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:14:18,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 01:14:18,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 01:14:18,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 01:14:18,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:18,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:18,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:14:18,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:14:18,245 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:14:18,245 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:14:18,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870344671] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:14:18,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:14:18,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-04 01:14:18,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444989390] [2025-03-04 01:14:18,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:14:18,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:14:18,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:14:18,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:14:18,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:14:18,246 INFO L87 Difference]: Start difference. First operand 1100 states and 1495 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:14:18,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:14:18,377 INFO L93 Difference]: Finished difference Result 2230 states and 3031 transitions. [2025-03-04 01:14:18,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:14:18,377 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 124 [2025-03-04 01:14:18,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:14:18,381 INFO L225 Difference]: With dead ends: 2230 [2025-03-04 01:14:18,381 INFO L226 Difference]: Without dead ends: 1133 [2025-03-04 01:14:18,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:14:18,387 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:14:18,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 600 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:14:18,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2025-03-04 01:14:18,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 1133. [2025-03-04 01:14:18,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1133 states, 993 states have (on average 1.3131923464249748) internal successors, (1304), 999 states have internal predecessors, (1304), 112 states have call successors, (112), 27 states have call predecessors, (112), 27 states have return successors, (112), 106 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-04 01:14:18,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 1528 transitions. [2025-03-04 01:14:18,520 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 1528 transitions. Word has length 124 [2025-03-04 01:14:18,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:14:18,520 INFO L471 AbstractCegarLoop]: Abstraction has 1133 states and 1528 transitions. [2025-03-04 01:14:18,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:14:18,521 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 1528 transitions. [2025-03-04 01:14:18,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-04 01:14:18,521 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:14:18,522 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:14:18,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 01:14:18,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:14:18,722 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:14:18,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:14:18,723 INFO L85 PathProgramCache]: Analyzing trace with hash 495129480, now seen corresponding path program 1 times [2025-03-04 01:14:18,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:14:18,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840297307] [2025-03-04 01:14:18,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:18,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:14:18,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-04 01:14:18,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-04 01:14:18,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:18,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:18,992 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:14:18,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:14:18,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840297307] [2025-03-04 01:14:18,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840297307] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:14:18,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:14:18,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:14:18,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561992556] [2025-03-04 01:14:18,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:14:18,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:14:18,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:14:18,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:14:18,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:14:18,994 INFO L87 Difference]: Start difference. First operand 1133 states and 1528 transitions. Second operand has 8 states, 7 states have (on average 9.857142857142858) internal successors, (69), 8 states have internal predecessors, (69), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-04 01:14:19,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:14:19,298 INFO L93 Difference]: Finished difference Result 2245 states and 3024 transitions. [2025-03-04 01:14:19,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:14:19,299 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.857142857142858) internal successors, (69), 8 states have internal predecessors, (69), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 126 [2025-03-04 01:14:19,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:14:19,305 INFO L225 Difference]: With dead ends: 2245 [2025-03-04 01:14:19,305 INFO L226 Difference]: Without dead ends: 1115 [2025-03-04 01:14:19,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:14:19,307 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 403 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:14:19,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 642 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:14:19,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2025-03-04 01:14:19,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 1103. [2025-03-04 01:14:19,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1103 states, 963 states have (on average 1.3032191069574248) internal successors, (1255), 969 states have internal predecessors, (1255), 112 states have call successors, (112), 27 states have call predecessors, (112), 27 states have return successors, (112), 106 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-04 01:14:19,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 1479 transitions. [2025-03-04 01:14:19,439 INFO L78 Accepts]: Start accepts. Automaton has 1103 states and 1479 transitions. Word has length 126 [2025-03-04 01:14:19,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:14:19,439 INFO L471 AbstractCegarLoop]: Abstraction has 1103 states and 1479 transitions. [2025-03-04 01:14:19,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.857142857142858) internal successors, (69), 8 states have internal predecessors, (69), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-04 01:14:19,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1479 transitions. [2025-03-04 01:14:19,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-04 01:14:19,440 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:14:19,440 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:14:19,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-04 01:14:19,440 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:14:19,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:14:19,440 INFO L85 PathProgramCache]: Analyzing trace with hash -461792878, now seen corresponding path program 1 times [2025-03-04 01:14:19,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:14:19,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713628954] [2025-03-04 01:14:19,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:19,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:14:19,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-04 01:14:19,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-04 01:14:19,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:19,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:19,643 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:14:19,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:14:19,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713628954] [2025-03-04 01:14:19,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713628954] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:14:19,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:14:19,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:14:19,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485637165] [2025-03-04 01:14:19,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:14:19,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:14:19,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:14:19,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:14:19,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:14:19,645 INFO L87 Difference]: Start difference. First operand 1103 states and 1479 transitions. Second operand has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 01:14:19,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:14:19,925 INFO L93 Difference]: Finished difference Result 2174 states and 2921 transitions. [2025-03-04 01:14:19,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:14:19,926 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 128 [2025-03-04 01:14:19,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:14:19,929 INFO L225 Difference]: With dead ends: 2174 [2025-03-04 01:14:19,929 INFO L226 Difference]: Without dead ends: 1366 [2025-03-04 01:14:19,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:14:19,930 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 456 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:14:19,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 894 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:14:19,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1366 states. [2025-03-04 01:14:20,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1366 to 1164. [2025-03-04 01:14:20,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1164 states, 1024 states have (on average 1.298828125) internal successors, (1330), 1030 states have internal predecessors, (1330), 112 states have call successors, (112), 27 states have call predecessors, (112), 27 states have return successors, (112), 106 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-04 01:14:20,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 1164 states and 1554 transitions. [2025-03-04 01:14:20,011 INFO L78 Accepts]: Start accepts. Automaton has 1164 states and 1554 transitions. Word has length 128 [2025-03-04 01:14:20,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:14:20,011 INFO L471 AbstractCegarLoop]: Abstraction has 1164 states and 1554 transitions. [2025-03-04 01:14:20,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 01:14:20,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1164 states and 1554 transitions. [2025-03-04 01:14:20,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-04 01:14:20,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:14:20,013 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:14:20,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-04 01:14:20,013 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:14:20,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:14:20,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1345661585, now seen corresponding path program 1 times [2025-03-04 01:14:20,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:14:20,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384049080] [2025-03-04 01:14:20,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:20,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:14:20,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-04 01:14:20,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-04 01:14:20,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:20,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:20,857 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:14:20,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:14:20,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384049080] [2025-03-04 01:14:20,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384049080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:14:20,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:14:20,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-04 01:14:20,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266203609] [2025-03-04 01:14:20,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:14:20,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 01:14:20,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:14:20,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 01:14:20,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:14:20,860 INFO L87 Difference]: Start difference. First operand 1164 states and 1554 transitions. Second operand has 14 states, 14 states have (on average 5.071428571428571) internal successors, (71), 14 states have internal predecessors, (71), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 01:14:23,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:14:23,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:14:23,306 INFO L93 Difference]: Finished difference Result 2161 states and 2895 transitions. [2025-03-04 01:14:23,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 01:14:23,308 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.071428571428571) internal successors, (71), 14 states have internal predecessors, (71), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 128 [2025-03-04 01:14:23,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:14:23,311 INFO L225 Difference]: With dead ends: 2161 [2025-03-04 01:14:23,312 INFO L226 Difference]: Without dead ends: 1292 [2025-03-04 01:14:23,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2025-03-04 01:14:23,313 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 310 mSDsluCounter, 1614 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 1845 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-04 01:14:23,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 1845 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 593 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-04 01:14:23,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2025-03-04 01:14:23,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 1166. [2025-03-04 01:14:23,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1166 states, 1026 states have (on average 1.2982456140350878) internal successors, (1332), 1032 states have internal predecessors, (1332), 112 states have call successors, (112), 27 states have call predecessors, (112), 27 states have return successors, (112), 106 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-04 01:14:23,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1166 states to 1166 states and 1556 transitions. [2025-03-04 01:14:23,406 INFO L78 Accepts]: Start accepts. Automaton has 1166 states and 1556 transitions. Word has length 128 [2025-03-04 01:14:23,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:14:23,407 INFO L471 AbstractCegarLoop]: Abstraction has 1166 states and 1556 transitions. [2025-03-04 01:14:23,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.071428571428571) internal successors, (71), 14 states have internal predecessors, (71), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 01:14:23,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1166 states and 1556 transitions. [2025-03-04 01:14:23,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-04 01:14:23,408 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:14:23,408 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:14:23,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-04 01:14:23,408 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:14:23,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:14:23,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1649497491, now seen corresponding path program 1 times [2025-03-04 01:14:23,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:14:23,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814307725] [2025-03-04 01:14:23,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:23,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:14:23,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-04 01:14:23,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-04 01:14:23,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:23,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:24,099 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:14:24,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:14:24,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814307725] [2025-03-04 01:14:24,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814307725] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:14:24,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:14:24,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-04 01:14:24,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955483661] [2025-03-04 01:14:24,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:14:24,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 01:14:24,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:14:24,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 01:14:24,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:14:24,102 INFO L87 Difference]: Start difference. First operand 1166 states and 1556 transitions. Second operand has 14 states, 14 states have (on average 5.071428571428571) internal successors, (71), 14 states have internal predecessors, (71), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 01:14:24,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:14:24,778 INFO L93 Difference]: Finished difference Result 2179 states and 2913 transitions. [2025-03-04 01:14:24,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 01:14:24,778 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.071428571428571) internal successors, (71), 14 states have internal predecessors, (71), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 128 [2025-03-04 01:14:24,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:14:24,782 INFO L225 Difference]: With dead ends: 2179 [2025-03-04 01:14:24,782 INFO L226 Difference]: Without dead ends: 1308 [2025-03-04 01:14:24,783 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=484, Unknown=0, NotChecked=0, Total=600 [2025-03-04 01:14:24,783 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 549 mSDsluCounter, 1610 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 1840 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:14:24,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 1840 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:14:24,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2025-03-04 01:14:24,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 1003. [2025-03-04 01:14:24,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 885 states have (on average 1.3016949152542372) internal successors, (1152), 889 states have internal predecessors, (1152), 94 states have call successors, (94), 23 states have call predecessors, (94), 23 states have return successors, (94), 90 states have call predecessors, (94), 94 states have call successors, (94) [2025-03-04 01:14:24,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1340 transitions. [2025-03-04 01:14:24,853 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1340 transitions. Word has length 128 [2025-03-04 01:14:24,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:14:24,853 INFO L471 AbstractCegarLoop]: Abstraction has 1003 states and 1340 transitions. [2025-03-04 01:14:24,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.071428571428571) internal successors, (71), 14 states have internal predecessors, (71), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 01:14:24,853 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1340 transitions. [2025-03-04 01:14:24,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-04 01:14:24,854 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:14:24,854 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:14:24,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-04 01:14:24,854 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:14:24,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:14:24,855 INFO L85 PathProgramCache]: Analyzing trace with hash -838015342, now seen corresponding path program 1 times [2025-03-04 01:14:24,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:14:24,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61027492] [2025-03-04 01:14:24,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:24,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:14:24,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-04 01:14:24,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-04 01:14:24,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:24,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:25,102 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:14:25,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:14:25,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61027492] [2025-03-04 01:14:25,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61027492] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:14:25,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:14:25,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:14:25,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718360641] [2025-03-04 01:14:25,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:14:25,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:14:25,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:14:25,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:14:25,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:14:25,103 INFO L87 Difference]: Start difference. First operand 1003 states and 1340 transitions. Second operand has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 01:14:25,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:14:25,415 INFO L93 Difference]: Finished difference Result 1815 states and 2436 transitions. [2025-03-04 01:14:25,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:14:25,416 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 128 [2025-03-04 01:14:25,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:14:25,419 INFO L225 Difference]: With dead ends: 1815 [2025-03-04 01:14:25,419 INFO L226 Difference]: Without dead ends: 1107 [2025-03-04 01:14:25,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:14:25,421 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 580 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:14:25,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [580 Valid, 849 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:14:25,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2025-03-04 01:14:25,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 999. [2025-03-04 01:14:25,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 999 states, 881 states have (on average 1.300794551645857) internal successors, (1146), 885 states have internal predecessors, (1146), 94 states have call successors, (94), 23 states have call predecessors, (94), 23 states have return successors, (94), 90 states have call predecessors, (94), 94 states have call successors, (94) [2025-03-04 01:14:25,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1334 transitions. [2025-03-04 01:14:25,492 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 1334 transitions. Word has length 128 [2025-03-04 01:14:25,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:14:25,492 INFO L471 AbstractCegarLoop]: Abstraction has 999 states and 1334 transitions. [2025-03-04 01:14:25,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 01:14:25,492 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1334 transitions. [2025-03-04 01:14:25,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-04 01:14:25,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:14:25,496 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:14:25,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-04 01:14:25,496 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:14:25,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:14:25,496 INFO L85 PathProgramCache]: Analyzing trace with hash -235275007, now seen corresponding path program 1 times [2025-03-04 01:14:25,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:14:25,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892248378] [2025-03-04 01:14:25,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:25,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:14:25,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-04 01:14:25,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-04 01:14:25,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:25,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:14:25,533 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 01:14:25,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-04 01:14:25,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-04 01:14:25,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:25,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:14:25,642 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 01:14:25,642 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 01:14:25,643 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 01:14:25,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-04 01:14:25,646 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:14:25,770 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 01:14:25,772 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 01:14:25 BoogieIcfgContainer [2025-03-04 01:14:25,772 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 01:14:25,773 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 01:14:25,773 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 01:14:25,773 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 01:14:25,775 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:13:52" (3/4) ... [2025-03-04 01:14:25,776 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 01:14:25,777 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 01:14:25,777 INFO L158 Benchmark]: Toolchain (without parser) took 34303.47ms. Allocated memory was 201.3MB in the beginning and 654.3MB in the end (delta: 453.0MB). Free memory was 158.5MB in the beginning and 323.7MB in the end (delta: -165.2MB). Peak memory consumption was 286.9MB. Max. memory is 16.1GB. [2025-03-04 01:14:25,777 INFO L158 Benchmark]: CDTParser took 0.53ms. Allocated memory is still 201.3MB. Free memory is still 116.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:14:25,777 INFO L158 Benchmark]: CACSL2BoogieTranslator took 194.92ms. Allocated memory is still 201.3MB. Free memory was 158.5MB in the beginning and 143.8MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 01:14:25,778 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.09ms. Allocated memory is still 201.3MB. Free memory was 143.8MB in the beginning and 140.7MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:14:25,778 INFO L158 Benchmark]: Boogie Preprocessor took 59.26ms. Allocated memory is still 201.3MB. Free memory was 140.7MB in the beginning and 137.1MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:14:25,778 INFO L158 Benchmark]: IcfgBuilder took 597.52ms. Allocated memory is still 201.3MB. Free memory was 137.1MB in the beginning and 102.2MB in the end (delta: 34.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-04 01:14:25,778 INFO L158 Benchmark]: TraceAbstraction took 33402.52ms. Allocated memory was 201.3MB in the beginning and 654.3MB in the end (delta: 453.0MB). Free memory was 101.6MB in the beginning and 323.9MB in the end (delta: -222.2MB). Peak memory consumption was 228.2MB. Max. memory is 16.1GB. [2025-03-04 01:14:25,778 INFO L158 Benchmark]: Witness Printer took 3.90ms. Allocated memory is still 654.3MB. Free memory was 323.9MB in the beginning and 323.7MB in the end (delta: 135.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:14:25,778 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.53ms. Allocated memory is still 201.3MB. Free memory is still 116.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 194.92ms. Allocated memory is still 201.3MB. Free memory was 158.5MB in the beginning and 143.8MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.09ms. Allocated memory is still 201.3MB. Free memory was 143.8MB in the beginning and 140.7MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 59.26ms. Allocated memory is still 201.3MB. Free memory was 140.7MB in the beginning and 137.1MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 597.52ms. Allocated memory is still 201.3MB. Free memory was 137.1MB in the beginning and 102.2MB in the end (delta: 34.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 33402.52ms. Allocated memory was 201.3MB in the beginning and 654.3MB in the end (delta: 453.0MB). Free memory was 101.6MB in the beginning and 323.9MB in the end (delta: -222.2MB). Peak memory consumption was 228.2MB. Max. memory is 16.1GB. * Witness Printer took 3.90ms. Allocated memory is still 654.3MB. Free memory was 323.9MB in the beginning and 323.7MB in the end (delta: 135.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 someBinaryArithmeticDOUBLEoperation at line 106, overapproximation of someBinaryArithmeticDOUBLEoperation at line 75, overapproximation of someBinaryArithmeticDOUBLEoperation at line 75, overapproximation of someBinaryDOUBLEComparisonOperation at line 92, overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of someBinaryDOUBLEComparisonOperation at line 106, overapproximation of someBinaryDOUBLEComparisonOperation at line 90, overapproximation of someBinaryDOUBLEComparisonOperation at line 75, overapproximation of someBinaryDOUBLEComparisonOperation at line 90, overapproximation of someBinaryDOUBLEComparisonOperation at line 88, overapproximation of someBinaryDOUBLEComparisonOperation at line 92, overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of someBinaryDOUBLEComparisonOperation at line 88, overapproximation of someBinaryDOUBLEComparisonOperation at line 106. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L25] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer = &(BOOL_unsigned_char_Array_0[0]); [L26] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer = &(BOOL_unsigned_char_Array_0[1]); [L27-L29] double double_Array_0[5] = { 9.75, 5.1, 32.6, 128.1, 63.9 }; [L27-L29] double double_Array_0[5] = { 9.75, 5.1, 32.6, 128.1, 63.9 }; [L27-L29] double double_Array_0[5] = { 9.75, 5.1, 32.6, 128.1, 63.9 }; [L27-L29] double double_Array_0[5] = { 9.75, 5.1, 32.6, 128.1, 63.9 }; [L27-L29] double double_Array_0[5] = { 9.75, 5.1, 32.6, 128.1, 63.9 }; [L27-L29] double double_Array_0[5] = { 9.75, 5.1, 32.6, 128.1, 63.9 }; [L30] double* double_Array_0_arraydouble_Array_0arrayVar0_Pointer = &(double_Array_0[0]); [L31] double* double_Array_0_arraydouble_Array_0arrayVar1_Pointer = &(double_Array_0[1]); [L32] double* double_Array_0_arraydouble_Array_0arrayVar2_Pointer = &(double_Array_0[2]); [L33] double* double_Array_0_arraydouble_Array_0arrayVar3_Pointer = &(double_Array_0[3]); [L34] double* double_Array_0_arraydouble_Array_0arrayVar4_Pointer = &(double_Array_0[4]); [L35-L37] signed char signed_char_Array_0[2] = { 8, -128 }; [L35-L37] signed char signed_char_Array_0[2] = { 8, -128 }; [L35-L37] signed char signed_char_Array_0[2] = { 8, -128 }; [L38] signed char* signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer = &(signed_char_Array_0[0]); [L39] signed char* signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer = &(signed_char_Array_0[1]); [L40-L42] signed long int signed_long_int_Array_0[1] = { -10 }; [L40-L42] signed long int signed_long_int_Array_0[1] = { -10 }; [L43] signed long int* signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer = &(signed_long_int_Array_0[0]); [L44-L46] unsigned long int unsigned_long_int_Array_0[2] = { 1885310857, 1 }; [L44-L46] unsigned long int unsigned_long_int_Array_0[2] = { 1885310857, 1 }; [L44-L46] unsigned long int unsigned_long_int_Array_0[2] = { 1885310857, 1 }; [L47] unsigned long int* unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer = &(unsigned_long_int_Array_0[0]); [L48] unsigned long int* unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer = &(unsigned_long_int_Array_0[1]); [L49] signed long int last_1_signed_long_int_Array_0_0_ = -10; VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=0, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L110] isInitial = 1 [L111] FCALL initially() [L112] COND TRUE 1 [L113] CALL updateLastVariables() [L103] EXPR signed_long_int_Array_0[0] [L103] last_1_signed_long_int_Array_0_0_ = signed_long_int_Array_0[0] [L113] RET updateLastVariables() [L114] CALL updateVariables() [L81] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L82] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L82] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L82] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L83] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L83] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L83] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L84] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L85] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L85] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L85] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L86] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L86] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L86] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L87] double_Array_0[0] = __VERIFIER_nondet_double() [L88] EXPR double_Array_0[0] [L88] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L88] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F [L88] EXPR double_Array_0[0] [L88] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L88] EXPR (double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L88] EXPR (double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L88] CALL assume_abort_if_not((double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L88] RET assume_abort_if_not((double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L89] double_Array_0[1] = __VERIFIER_nondet_double() [L90] EXPR double_Array_0[1] [L90] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L90] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F [L90] EXPR double_Array_0[1] [L90] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L90] EXPR (double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L90] EXPR (double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L90] CALL assume_abort_if_not((double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L90] RET assume_abort_if_not((double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L91] double_Array_0[3] = __VERIFIER_nondet_double() [L92] EXPR double_Array_0[3] [L92] EXPR double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L92] EXPR double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F [L92] EXPR double_Array_0[3] [L92] EXPR double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L92] EXPR (double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 4611686.018427382800e+12F && double_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L92] EXPR (double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 4611686.018427382800e+12F && double_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L92] CALL assume_abort_if_not((double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 4611686.018427382800e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L92] RET assume_abort_if_not((double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 4611686.018427382800e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L93] double_Array_0[4] = __VERIFIER_nondet_double() [L94] EXPR double_Array_0[4] [L94] EXPR double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L94] EXPR double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F [L94] EXPR double_Array_0[4] [L94] EXPR double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L94] EXPR (double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854765600e+12F && double_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L94] EXPR (double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854765600e+12F && double_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L94] CALL assume_abort_if_not((double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854765600e+12F && double_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L94] RET assume_abort_if_not((double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854765600e+12F && double_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L95] signed_char_Array_0[0] = __VERIFIER_nondet_char() [L96] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L96] CALL assume_abort_if_not(signed_char_Array_0[0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L96] RET assume_abort_if_not(signed_char_Array_0[0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L97] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L97] CALL assume_abort_if_not(signed_char_Array_0[0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L97] RET assume_abort_if_not(signed_char_Array_0[0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L98] unsigned_long_int_Array_0[0] = __VERIFIER_nondet_ulong() [L99] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L99] CALL assume_abort_if_not(unsigned_long_int_Array_0[0] >= 1073741824) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L99] RET assume_abort_if_not(unsigned_long_int_Array_0[0] >= 1073741824) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L100] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L100] CALL assume_abort_if_not(unsigned_long_int_Array_0[0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L100] RET assume_abort_if_not(unsigned_long_int_Array_0[0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L114] RET updateVariables() [L115] CALL step() [L53] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L53] COND FALSE !((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) [L56] EXPR \read(*unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L56] EXPR ((last_1_signed_long_int_Array_0_0_) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? (last_1_signed_long_int_Array_0_0_) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) [L56] EXPR ((last_1_signed_long_int_Array_0_0_) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? (last_1_signed_long_int_Array_0_0_) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L56] (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) = ((((last_1_signed_long_int_Array_0_0_) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? (last_1_signed_long_int_Array_0_0_) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))))) [L58] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L58] COND FALSE !((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) [L61] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer) [L61] unsigned char stepLocal_1 = (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)); [L62] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer) [L62] signed long int stepLocal_0 = (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)); [L63] stepLocal_1 || ((~ (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) >= (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, stepLocal_0=-10, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L63] stepLocal_1 || ((~ (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) >= (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) [L63] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer) [L63] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer) [L63] stepLocal_1 || ((~ (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) >= (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, stepLocal_0=-10, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L63] COND TRUE stepLocal_1 || ((~ (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) >= (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) [L64] EXPR \read(*unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L64] COND FALSE !(stepLocal_0 < (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))) [L69] (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) = 2 VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L74] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer) [L74] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L74] COND TRUE (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) >= (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) [L75] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar0_Pointer) [L75] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar1_Pointer) [L75] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar3_Pointer) [L75] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar4_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L75] EXPR ((((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) > ((*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer)))) ? (((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) : ((*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer))) [L75] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar1_Pointer) [L75] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar3_Pointer) [L75] EXPR ((((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) > ((*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer)))) ? (((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) : ((*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L75] (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) = ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) - ((((((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) > ((*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer)))) ? (((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) : ((*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer)))))) [L115] RET step() [L116] CALL, EXPR property() [L106] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer) [L106] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) || ((~ (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) >= (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L106] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) || ((~ (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) >= (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) [L106] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer) [L106] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer) [L106] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) || ((~ (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) >= (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L106] EXPR ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) || ((~ (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) >= (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) < (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))) ? ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) : 1) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) 2))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) [L106] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer) [L106] EXPR \read(*unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L106] EXPR ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) < (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))) ? ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) : 1) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) 2)) [L106] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer) [L106] EXPR ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) < (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))) ? ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) : 1) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) 2)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L106] EXPR ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) || ((~ (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) >= (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) < (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))) ? ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) : 1) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) 2))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L106] EXPR (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) || ((~ (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) >= (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) < (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))) ? ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) : 1) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) 2))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) < 0 ) ? -((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))))) - last_1_signed_long_int_Array_0_0_))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? (last_1_signed_long_int_Array_0_0_) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L106] EXPR (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) || ((~ (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) >= (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) < (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))) ? ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) : 1) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) 2))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) < 0 ) ? -((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))))) - last_1_signed_long_int_Array_0_0_))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? (last_1_signed_long_int_Array_0_0_) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))))))) [L106] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L106] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) < 0 ) ? -((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))))) - last_1_signed_long_int_Array_0_0_))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? (last_1_signed_long_int_Array_0_0_) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))))))) [L106] EXPR \read(*unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer) [L106] EXPR \read(*unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L106] EXPR ((last_1_signed_long_int_Array_0_0_) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? (last_1_signed_long_int_Array_0_0_) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) [L106] EXPR ((last_1_signed_long_int_Array_0_0_) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? (last_1_signed_long_int_Array_0_0_) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L106] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) < 0 ) ? -((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))))) - last_1_signed_long_int_Array_0_0_))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? (last_1_signed_long_int_Array_0_0_) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L106] EXPR (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) || ((~ (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) >= (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) < (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))) ? ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) : 1) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) 2))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) < 0 ) ? -((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))))) - last_1_signed_long_int_Array_0_0_))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? (last_1_signed_long_int_Array_0_0_) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L106] EXPR ((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) || ((~ (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) >= (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) < (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))) ? ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) : 1) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) 2))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) < 0 ) ? -((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))))) - last_1_signed_long_int_Array_0_0_))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? (last_1_signed_long_int_Array_0_0_) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))))))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) + (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < 0 ) ? -((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L106] EXPR ((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) || ((~ (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) >= (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) < (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))) ? ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) : 1) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) 2))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) < 0 ) ? -((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))))) - last_1_signed_long_int_Array_0_0_))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? (last_1_signed_long_int_Array_0_0_) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))))))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) + (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < 0 ) ? -((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))))))) : 1) [L106] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L106] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) + (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < 0 ) ? -((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))))))) : 1 [L106] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) + (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < 0 ) ? -((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))))))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L106] EXPR ((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) || ((~ (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) >= (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) < (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))) ? ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) : 1) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) 2))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) < 0 ) ? -((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))))) - last_1_signed_long_int_Array_0_0_))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? (last_1_signed_long_int_Array_0_0_) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))))))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) + (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < 0 ) ? -((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L106] EXPR (((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) || ((~ (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) >= (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) < (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))) ? ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) : 1) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) 2))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) < 0 ) ? -((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))))) - last_1_signed_long_int_Array_0_0_))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? (last_1_signed_long_int_Array_0_0_) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))))))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) + (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < 0 ) ? -((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))))))) : 1)) && (((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) >= (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) - ((((((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) > ((*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer)))) ? (((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) : ((*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer)))))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (((((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))) > ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L106] EXPR (((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) || ((~ (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) >= (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) < (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))) ? ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) : 1) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) 2))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) < 0 ) ? -((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))))) - last_1_signed_long_int_Array_0_0_))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? (last_1_signed_long_int_Array_0_0_) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))))))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) + (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < 0 ) ? -((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))))))) : 1)) && (((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) >= (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) - ((((((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) > ((*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer)))) ? (((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) : ((*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer)))))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (((((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))) > ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))))))) [L106] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer) [L106] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L106] EXPR ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) >= (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) - ((((((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) > ((*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer)))) ? (((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) : ((*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer)))))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (((((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))) > ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))))) [L106] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar2_Pointer) [L106] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar0_Pointer) [L106] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar1_Pointer) [L106] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar3_Pointer) [L106] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar4_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L106] EXPR ((((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) > ((*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer)))) ? (((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) : ((*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer))) [L106] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar1_Pointer) [L106] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar3_Pointer) [L106] EXPR ((((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) > ((*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer)))) ? (((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) : ((*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L106] EXPR ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) >= (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) - ((((((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) > ((*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer)))) ? (((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) : ((*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer)))))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (((((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))) > ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L106] EXPR (((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) || ((~ (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) >= (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) < (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))) ? ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) : 1) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) 2))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) < 0 ) ? -((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))))) - last_1_signed_long_int_Array_0_0_))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? (last_1_signed_long_int_Array_0_0_) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))))))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) + (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < 0 ) ? -((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))))))) : 1)) && (((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) >= (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) - ((((((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) > ((*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer)))) ? (((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) : ((*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer)))))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (((((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))) > ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L106-L107] return (((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) || ((~ (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) >= (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) < (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))) ? ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) : 1) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) 2))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) < 0 ) ? -((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))))) - last_1_signed_long_int_Array_0_0_))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? (last_1_signed_long_int_Array_0_0_) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))))))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) + (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < 0 ) ? -((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))))))) : 1)) && (((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) >= (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) - ((((((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) > ((*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer)))) ? (((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) : ((*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer)))))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (((((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))) > ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))))))) ; [L116] RET, EXPR property() [L116] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 112 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 33.2s, OverallIterations: 36, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 16.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10917 SdHoareTripleChecker+Valid, 10.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10916 mSDsluCounter, 39284 SdHoareTripleChecker+Invalid, 8.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 31725 mSDsCounter, 1385 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9467 IncrementalHoareTripleChecker+Invalid, 10852 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1385 mSolverCounterUnsat, 7559 mSDtfsCounter, 9467 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 759 GetRequests, 367 SyntacticMatches, 0 SemanticMatches, 392 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1301occurred in iteration=17, InterpolantAutomatonStates: 275, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.5s AutomataMinimizationTime, 35 MinimizatonAttempts, 3299 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 11.7s InterpolantComputationTime, 4604 NumberOfCodeBlocks, 4604 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 4439 ConstructedInterpolants, 0 QuantifiedInterpolants, 27458 SizeOfPredicates, 0 NumberOfNonLiveVariables, 952 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 37 InterpolantComputations, 35 PerfectInterpolantSequences, 9713/9768 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-04 01:14:25,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-15.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1cf2833edd1cdae0e001cafaa7cd8c6b44382f8b73a263b509a9183609c6c876 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:14:27,586 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:14:27,705 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 01:14:27,709 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:14:27,710 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:14:27,733 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:14:27,735 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:14:27,735 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:14:27,736 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:14:27,736 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:14:27,737 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:14:27,737 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:14:27,737 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:14:27,738 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:14:27,738 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:14:27,738 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:14:27,738 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:14:27,738 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:14:27,739 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:14:27,739 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:14:27,739 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:14:27,739 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:14:27,739 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:14:27,739 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 01:14:27,739 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 01:14:27,740 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 01:14:27,740 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:14:27,740 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:14:27,740 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:14:27,740 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:14:27,740 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:14:27,741 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:14:27,741 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:14:27,741 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:14:27,741 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:14:27,741 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:14:27,741 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:14:27,741 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:14:27,741 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:14:27,742 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 01:14:27,742 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 01:14:27,742 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:14:27,742 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:14:27,742 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:14:27,742 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:14:27,743 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1cf2833edd1cdae0e001cafaa7cd8c6b44382f8b73a263b509a9183609c6c876 [2025-03-04 01:14:28,008 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:14:28,014 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:14:28,015 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:14:28,016 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:14:28,017 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:14:28,018 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-15.i [2025-03-04 01:14:29,199 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f90180dd/78b17249421c42d5bce5565fe0ebc138/FLAG39bfaf2d0 [2025-03-04 01:14:29,402 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:14:29,404 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-15.i [2025-03-04 01:14:29,410 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f90180dd/78b17249421c42d5bce5565fe0ebc138/FLAG39bfaf2d0 [2025-03-04 01:14:29,428 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f90180dd/78b17249421c42d5bce5565fe0ebc138 [2025-03-04 01:14:29,431 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:14:29,434 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:14:29,435 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:14:29,435 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:14:29,438 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:14:29,439 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:14:29" (1/1) ... [2025-03-04 01:14:29,441 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dc16e96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:14:29, skipping insertion in model container [2025-03-04 01:14:29,441 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:14:29" (1/1) ... [2025-03-04 01:14:29,458 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:14:29,567 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-15.i[917,930] [2025-03-04 01:14:29,628 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:14:29,646 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:14:29,655 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-15.i[917,930] [2025-03-04 01:14:29,681 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:14:29,700 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:14:29,701 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:14:29 WrapperNode [2025-03-04 01:14:29,701 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:14:29,701 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:14:29,702 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:14:29,702 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:14:29,706 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:14:29" (1/1) ... [2025-03-04 01:14:29,714 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:14:29" (1/1) ... [2025-03-04 01:14:29,744 INFO L138 Inliner]: procedures = 33, calls = 155, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 509 [2025-03-04 01:14:29,745 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:14:29,745 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:14:29,746 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:14:29,746 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:14:29,753 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:14:29" (1/1) ... [2025-03-04 01:14:29,753 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:14:29" (1/1) ... [2025-03-04 01:14:29,760 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:14:29" (1/1) ... [2025-03-04 01:14:29,782 INFO L175 MemorySlicer]: Split 127 memory accesses to 6 slices as follows [2, 16, 51, 25, 10, 23]. 40 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 2, 5, 2, 1, 2]. The 16 writes are split as follows [0, 2, 6, 4, 1, 3]. [2025-03-04 01:14:29,783 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:14:29" (1/1) ... [2025-03-04 01:14:29,783 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:14:29" (1/1) ... [2025-03-04 01:14:29,798 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:14:29" (1/1) ... [2025-03-04 01:14:29,800 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:14:29" (1/1) ... [2025-03-04 01:14:29,802 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:14:29" (1/1) ... [2025-03-04 01:14:29,809 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:14:29" (1/1) ... [2025-03-04 01:14:29,813 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:14:29,814 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:14:29,814 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:14:29,814 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:14:29,815 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:14:29" (1/1) ... [2025-03-04 01:14:29,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:14:29,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:14:29,840 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 01:14:29,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 01:14:29,860 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:14:29,861 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-04 01:14:29,861 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-04 01:14:29,861 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-03-04 01:14:29,861 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-03-04 01:14:29,861 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2025-03-04 01:14:29,861 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2025-03-04 01:14:29,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-04 01:14:29,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-04 01:14:29,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-03-04 01:14:29,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-03-04 01:14:29,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2025-03-04 01:14:29,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2025-03-04 01:14:29,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-04 01:14:29,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-04 01:14:29,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-04 01:14:29,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-04 01:14:29,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-03-04 01:14:29,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-03-04 01:14:29,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 01:14:29,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-04 01:14:29,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-04 01:14:29,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-04 01:14:29,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-04 01:14:29,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-03-04 01:14:29,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-04 01:14:29,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-04 01:14:29,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-03-04 01:14:29,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-03-04 01:14:29,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-03-04 01:14:29,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-03-04 01:14:29,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-03-04 01:14:29,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-03-04 01:14:29,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-03-04 01:14:29,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-03-04 01:14:29,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2025-03-04 01:14:29,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2025-03-04 01:14:29,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-04 01:14:29,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-04 01:14:29,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-04 01:14:29,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-03-04 01:14:29,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-03-04 01:14:29,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-03-04 01:14:29,864 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:14:29,864 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:14:29,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:14:29,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:14:29,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-04 01:14:29,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-04 01:14:29,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-04 01:14:29,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-04 01:14:29,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-04 01:14:29,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-03-04 01:14:29,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-04 01:14:29,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-04 01:14:29,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-04 01:14:29,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-03-04 01:14:29,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-03-04 01:14:29,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-03-04 01:14:30,017 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:14:30,018 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:14:32,011 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L106: havoc property_#t~mem89#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~short90#1;havoc property_#t~ite101#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~ite98#1;havoc property_#t~mem93#1;havoc property_#t~ite96#1;havoc property_#t~mem95#1;havoc property_#t~mem94#1;havoc property_#t~mem97#1;havoc property_#t~mem100#1;havoc property_#t~mem99#1;havoc property_#t~mem102#1;havoc property_#t~ite112#1;havoc property_#t~mem107#1;havoc property_#t~mem103#1;havoc property_#t~ite106#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~mem111#1;havoc property_#t~mem108#1;havoc property_#t~ite110#1;havoc property_#t~mem109#1;havoc property_#t~short113#1;havoc property_#t~mem114#1;havoc property_#t~ite121#1;havoc property_#t~mem120#1;havoc property_#t~mem119#1;havoc property_#t~mem115#1;havoc property_#t~ite118#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~short122#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~ite140#1;havoc property_#t~mem133#1;havoc property_#t~mem132#1;havoc property_#t~mem125#1;havoc property_#t~mem126#1;havoc property_#t~mem127#1;havoc property_#t~ite131#1;havoc property_#t~mem128#1;havoc property_#t~mem129#1;havoc property_#t~mem130#1;havoc property_#t~mem139#1;havoc property_#t~mem134#1;havoc property_#t~mem135#1;havoc property_#t~ite138#1;havoc property_#t~mem136#1;havoc property_#t~mem137#1;havoc property_#t~short141#1; [2025-03-04 01:14:32,049 INFO L? ?]: Removed 136 outVars from TransFormulas that were not future-live. [2025-03-04 01:14:32,049 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:14:32,058 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:14:32,058 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:14:32,058 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:14:32 BoogieIcfgContainer [2025-03-04 01:14:32,059 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:14:32,061 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:14:32,061 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:14:32,064 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:14:32,064 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:14:29" (1/3) ... [2025-03-04 01:14:32,065 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7238b1ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:14:32, skipping insertion in model container [2025-03-04 01:14:32,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:14:29" (2/3) ... [2025-03-04 01:14:32,066 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7238b1ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:14:32, skipping insertion in model container [2025-03-04 01:14:32,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:14:32" (3/3) ... [2025-03-04 01:14:32,067 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-15.i [2025-03-04 01:14:32,076 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:14:32,077 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-ap_file-15.i that has 2 procedures, 112 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:14:32,114 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:14:32,137 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;@26abcae6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:14:32,138 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:14:32,142 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 97 states have (on average 1.443298969072165) internal successors, (140), 98 states have internal predecessors, (140), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 01:14:32,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-04 01:14:32,151 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:14:32,151 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:14:32,152 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:14:32,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:14:32,157 INFO L85 PathProgramCache]: Analyzing trace with hash -270087371, now seen corresponding path program 1 times [2025-03-04 01:14:32,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:14:32,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [487080482] [2025-03-04 01:14:32,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:32,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-03-04 01:14:32,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:14:32,171 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:14:32,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-04 01:14:32,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 01:14:32,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 01:14:32,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:32,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:32,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:14:32,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:14:32,669 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-03-04 01:14:32,669 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:14:32,670 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:14:32,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [487080482] [2025-03-04 01:14:32,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [487080482] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:14:32,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:14:32,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 01:14:32,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055633742] [2025-03-04 01:14:32,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:14:32,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:14:32,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:14:32,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:14:32,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:14:32,705 INFO L87 Difference]: Start difference. First operand has 112 states, 97 states have (on average 1.443298969072165) internal successors, (140), 98 states have internal predecessors, (140), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:14:32,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:14:32,728 INFO L93 Difference]: Finished difference Result 218 states and 335 transitions. [2025-03-04 01:14:32,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:14:32,731 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2025-03-04 01:14:32,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:14:32,736 INFO L225 Difference]: With dead ends: 218 [2025-03-04 01:14:32,736 INFO L226 Difference]: Without dead ends: 109 [2025-03-04 01:14:32,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:14:32,740 INFO L435 NwaCegarLoop]: 157 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, 157 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:14:32,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:14:32,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-04 01:14:32,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-03-04 01:14:32,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 95 states have (on average 1.4) internal successors, (133), 95 states have internal predecessors, (133), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 01:14:32,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 157 transitions. [2025-03-04 01:14:32,767 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 157 transitions. Word has length 115 [2025-03-04 01:14:32,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:14:32,768 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 157 transitions. [2025-03-04 01:14:32,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:14:32,768 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 157 transitions. [2025-03-04 01:14:32,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-04 01:14:32,771 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:14:32,771 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:14:32,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-04 01:14:32,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:14:32,973 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:14:32,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:14:32,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1200235572, now seen corresponding path program 1 times [2025-03-04 01:14:32,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:14:32,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1023959348] [2025-03-04 01:14:32,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:32,974 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:14:32,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:14:32,976 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:14:32,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-04 01:14:33,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 01:14:33,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 01:14:33,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:33,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:33,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 01:14:33,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:14:34,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-03-04 01:14:34,047 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 8 proven. 132 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-04 01:14:34,048 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:14:34,214 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:14:34,214 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:14:34,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1023959348] [2025-03-04 01:14:34,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1023959348] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:14:34,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:14:34,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2025-03-04 01:14:34,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927677811] [2025-03-04 01:14:34,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:14:34,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:14:34,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:14:34,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:14:34,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:14:34,219 INFO L87 Difference]: Start difference. First operand 109 states and 157 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:14:34,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:14:34,331 INFO L93 Difference]: Finished difference Result 267 states and 386 transitions. [2025-03-04 01:14:34,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:14:34,332 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2025-03-04 01:14:34,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:14:34,333 INFO L225 Difference]: With dead ends: 267 [2025-03-04 01:14:34,333 INFO L226 Difference]: Without dead ends: 161 [2025-03-04 01:14:34,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:14:34,334 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 150 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:14:34,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 561 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:14:34,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-03-04 01:14:34,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 111. [2025-03-04 01:14:34,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 97 states have (on average 1.3917525773195876) internal successors, (135), 97 states have internal predecessors, (135), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 01:14:34,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 159 transitions. [2025-03-04 01:14:34,346 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 159 transitions. Word has length 115 [2025-03-04 01:14:34,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:14:34,347 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 159 transitions. [2025-03-04 01:14:34,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:14:34,347 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 159 transitions. [2025-03-04 01:14:34,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-04 01:14:34,349 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:14:34,349 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:14:34,362 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-04 01:14:34,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:14:34,550 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:14:34,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:14:34,551 INFO L85 PathProgramCache]: Analyzing trace with hash -436067983, now seen corresponding path program 1 times [2025-03-04 01:14:34,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:14:34,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [197292404] [2025-03-04 01:14:34,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:34,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-03-04 01:14:34,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:14:34,554 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:14:34,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-04 01:14:34,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 01:14:34,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 01:14:34,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:34,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:34,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 01:14:34,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:14:35,198 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:14:35,198 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:14:35,198 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:14:35,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [197292404] [2025-03-04 01:14:35,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [197292404] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:14:35,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:14:35,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:14:35,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798726730] [2025-03-04 01:14:35,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:14:35,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:14:35,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:14:35,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:14:35,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:14:35,199 INFO L87 Difference]: Start difference. First operand 111 states and 159 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:14:35,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:14:35,303 INFO L93 Difference]: Finished difference Result 328 states and 473 transitions. [2025-03-04 01:14:35,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:14:35,304 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2025-03-04 01:14:35,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:14:35,306 INFO L225 Difference]: With dead ends: 328 [2025-03-04 01:14:35,306 INFO L226 Difference]: Without dead ends: 220 [2025-03-04 01:14:35,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 112 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-03-04 01:14:35,307 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 92 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:14:35,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 441 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:14:35,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-03-04 01:14:35,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 212. [2025-03-04 01:14:35,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 185 states have (on average 1.4) internal successors, (259), 185 states have internal predecessors, (259), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 01:14:35,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 307 transitions. [2025-03-04 01:14:35,325 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 307 transitions. Word has length 115 [2025-03-04 01:14:35,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:14:35,325 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 307 transitions. [2025-03-04 01:14:35,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:14:35,325 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 307 transitions. [2025-03-04 01:14:35,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-04 01:14:35,327 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:14:35,327 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:14:35,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-04 01:14:35,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:14:35,527 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:14:35,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:14:35,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1584841095, now seen corresponding path program 1 times [2025-03-04 01:14:35,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:14:35,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1530565190] [2025-03-04 01:14:35,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:35,530 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:14:35,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:14:35,532 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:14:35,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-04 01:14:35,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 01:14:35,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 01:14:35,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:35,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:35,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 01:14:35,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:14:36,240 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:14:36,240 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:14:36,240 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:14:36,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1530565190] [2025-03-04 01:14:36,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1530565190] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:14:36,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:14:36,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:14:36,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792917980] [2025-03-04 01:14:36,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:14:36,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:14:36,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:14:36,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:14:36,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:14:36,242 INFO L87 Difference]: Start difference. First operand 212 states and 307 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:14:36,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:14:36,301 INFO L93 Difference]: Finished difference Result 430 states and 621 transitions. [2025-03-04 01:14:36,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:14:36,302 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2025-03-04 01:14:36,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:14:36,303 INFO L225 Difference]: With dead ends: 430 [2025-03-04 01:14:36,303 INFO L226 Difference]: Without dead ends: 221 [2025-03-04 01:14:36,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 113 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-03-04 01:14:36,305 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 83 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:14:36,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 516 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:14:36,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2025-03-04 01:14:36,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 213. [2025-03-04 01:14:36,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 186 states have (on average 1.39247311827957) internal successors, (259), 186 states have internal predecessors, (259), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 01:14:36,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 307 transitions. [2025-03-04 01:14:36,323 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 307 transitions. Word has length 116 [2025-03-04 01:14:36,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:14:36,327 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 307 transitions. [2025-03-04 01:14:36,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:14:36,327 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 307 transitions. [2025-03-04 01:14:36,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-04 01:14:36,328 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:14:36,328 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:14:36,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-04 01:14:36,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:14:36,529 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:14:36,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:14:36,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1571966134, now seen corresponding path program 1 times [2025-03-04 01:14:36,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:14:36,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [169809956] [2025-03-04 01:14:36,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:36,530 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:14:36,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:14:36,532 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:14:36,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-04 01:14:36,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-04 01:14:36,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-04 01:14:36,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:36,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:36,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 01:14:36,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:14:37,284 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 8 proven. 132 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-04 01:14:37,285 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:14:37,407 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:14:37,407 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:14:37,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [169809956] [2025-03-04 01:14:37,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [169809956] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:14:37,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:14:37,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 12 [2025-03-04 01:14:37,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005603555] [2025-03-04 01:14:37,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:14:37,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:14:37,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:14:37,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:14:37,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:14:37,408 INFO L87 Difference]: Start difference. First operand 213 states and 307 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:14:37,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:14:37,513 INFO L93 Difference]: Finished difference Result 377 states and 540 transitions. [2025-03-04 01:14:37,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:14:37,514 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2025-03-04 01:14:37,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:14:37,518 INFO L225 Difference]: With dead ends: 377 [2025-03-04 01:14:37,518 INFO L226 Difference]: Without dead ends: 267 [2025-03-04 01:14:37,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:14:37,519 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 138 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:14:37,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 551 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:14:37,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-03-04 01:14:37,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 217. [2025-03-04 01:14:37,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 190 states have (on average 1.3894736842105264) internal successors, (264), 190 states have internal predecessors, (264), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 01:14:37,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 312 transitions. [2025-03-04 01:14:37,534 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 312 transitions. Word has length 117 [2025-03-04 01:14:37,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:14:37,534 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 312 transitions. [2025-03-04 01:14:37,534 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:14:37,534 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 312 transitions. [2025-03-04 01:14:37,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-04 01:14:37,535 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:14:37,535 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:14:37,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-03-04 01:14:37,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:14:37,736 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:14:37,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:14:37,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1646320721, now seen corresponding path program 1 times [2025-03-04 01:14:37,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:14:37,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1736830021] [2025-03-04 01:14:37,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:37,737 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:14:37,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:14:37,742 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:14:37,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-03-04 01:14:37,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-04 01:14:38,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-04 01:14:38,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:38,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:38,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 01:14:38,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:14:38,432 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 8 proven. 132 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-04 01:14:38,433 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:14:38,515 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:14:38,515 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:14:38,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1736830021] [2025-03-04 01:14:38,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1736830021] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:14:38,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:14:38,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2025-03-04 01:14:38,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77767453] [2025-03-04 01:14:38,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:14:38,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:14:38,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:14:38,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:14:38,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:14:38,517 INFO L87 Difference]: Start difference. First operand 217 states and 312 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:14:38,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:14:38,589 INFO L93 Difference]: Finished difference Result 378 states and 540 transitions. [2025-03-04 01:14:38,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:14:38,590 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2025-03-04 01:14:38,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:14:38,592 INFO L225 Difference]: With dead ends: 378 [2025-03-04 01:14:38,592 INFO L226 Difference]: Without dead ends: 264 [2025-03-04 01:14:38,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:14:38,592 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 142 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:14:38,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 509 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:14:38,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-03-04 01:14:38,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 215. [2025-03-04 01:14:38,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 188 states have (on average 1.377659574468085) internal successors, (259), 188 states have internal predecessors, (259), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 01:14:38,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 307 transitions. [2025-03-04 01:14:38,600 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 307 transitions. Word has length 117 [2025-03-04 01:14:38,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:14:38,600 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 307 transitions. [2025-03-04 01:14:38,600 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:14:38,600 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 307 transitions. [2025-03-04 01:14:38,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-04 01:14:38,601 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:14:38,601 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:14:38,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-03-04 01:14:38,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:14:38,805 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:14:38,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:14:38,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1448197663, now seen corresponding path program 1 times [2025-03-04 01:14:38,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:14:38,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [635316585] [2025-03-04 01:14:38,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:38,806 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:14:38,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:14:38,808 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:14:38,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-03-04 01:14:38,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-04 01:14:39,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-04 01:14:39,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:39,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:39,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 01:14:39,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:14:39,547 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 8 proven. 132 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-04 01:14:39,547 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:14:39,672 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:14:39,673 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:14:39,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [635316585] [2025-03-04 01:14:39,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [635316585] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:14:39,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:14:39,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 12 [2025-03-04 01:14:39,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100815132] [2025-03-04 01:14:39,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:14:39,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:14:39,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:14:39,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:14:39,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:14:39,674 INFO L87 Difference]: Start difference. First operand 215 states and 307 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:14:39,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:14:39,760 INFO L93 Difference]: Finished difference Result 376 states and 533 transitions. [2025-03-04 01:14:39,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:14:39,761 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2025-03-04 01:14:39,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:14:39,762 INFO L225 Difference]: With dead ends: 376 [2025-03-04 01:14:39,762 INFO L226 Difference]: Without dead ends: 264 [2025-03-04 01:14:39,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:14:39,763 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 118 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:14:39,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 541 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:14:39,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-03-04 01:14:39,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 226. [2025-03-04 01:14:39,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 199 states have (on average 1.3819095477386936) internal successors, (275), 199 states have internal predecessors, (275), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 01:14:39,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 323 transitions. [2025-03-04 01:14:39,771 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 323 transitions. Word has length 118 [2025-03-04 01:14:39,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:14:39,771 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 323 transitions. [2025-03-04 01:14:39,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:14:39,771 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 323 transitions. [2025-03-04 01:14:39,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-04 01:14:39,772 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:14:39,772 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:14:39,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2025-03-04 01:14:39,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:14:39,972 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:14:39,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:14:39,973 INFO L85 PathProgramCache]: Analyzing trace with hash -863063789, now seen corresponding path program 1 times [2025-03-04 01:14:39,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:14:39,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [433735578] [2025-03-04 01:14:39,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:39,973 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:14:39,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:14:39,975 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:14:39,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-03-04 01:14:40,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-04 01:14:40,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-04 01:14:40,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:40,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:40,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 01:14:40,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:14:40,347 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-03-04 01:14:40,374 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 37 treesize of output 25 [2025-03-04 01:14:40,397 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:14:40,397 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:14:40,397 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:14:40,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [433735578] [2025-03-04 01:14:40,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [433735578] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:14:40,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:14:40,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:14:40,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34318486] [2025-03-04 01:14:40,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:14:40,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:14:40,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:14:40,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:14:40,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:14:40,398 INFO L87 Difference]: Start difference. First operand 226 states and 323 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:14:40,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:14:40,557 INFO L93 Difference]: Finished difference Result 628 states and 899 transitions. [2025-03-04 01:14:40,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:14:40,557 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2025-03-04 01:14:40,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:14:40,559 INFO L225 Difference]: With dead ends: 628 [2025-03-04 01:14:40,559 INFO L226 Difference]: Without dead ends: 405 [2025-03-04 01:14:40,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 113 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-03-04 01:14:40,560 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 114 mSDsluCounter, 823 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:14:40,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 1058 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:14:40,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2025-03-04 01:14:40,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 401. [2025-03-04 01:14:40,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 356 states have (on average 1.3876404494382022) internal successors, (494), 358 states have internal predecessors, (494), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-04 01:14:40,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 574 transitions. [2025-03-04 01:14:40,574 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 574 transitions. Word has length 118 [2025-03-04 01:14:40,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:14:40,575 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 574 transitions. [2025-03-04 01:14:40,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:14:40,575 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 574 transitions. [2025-03-04 01:14:40,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-04 01:14:40,576 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:14:40,576 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:14:40,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2025-03-04 01:14:40,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:14:40,776 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:14:40,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:14:40,777 INFO L85 PathProgramCache]: Analyzing trace with hash -436956178, now seen corresponding path program 1 times [2025-03-04 01:14:40,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:14:40,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1940300046] [2025-03-04 01:14:40,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:40,777 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:14:40,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:14:40,779 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:14:40,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2025-03-04 01:14:40,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 01:14:41,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 01:14:41,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:41,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:41,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 01:14:41,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:14:41,551 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 11 treesize of output 9 [2025-03-04 01:14:41,615 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:14:41,615 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:14:41,615 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:14:41,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1940300046] [2025-03-04 01:14:41,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1940300046] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:14:41,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:14:41,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:14:41,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552141713] [2025-03-04 01:14:41,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:14:41,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:14:41,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:14:41,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:14:41,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:14:41,616 INFO L87 Difference]: Start difference. First operand 401 states and 574 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:14:42,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:14:42,112 INFO L93 Difference]: Finished difference Result 908 states and 1292 transitions. [2025-03-04 01:14:42,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:14:42,114 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2025-03-04 01:14:42,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:14:42,116 INFO L225 Difference]: With dead ends: 908 [2025-03-04 01:14:42,116 INFO L226 Difference]: Without dead ends: 510 [2025-03-04 01:14:42,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:14:42,118 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 407 mSDsluCounter, 1009 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 1240 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:14:42,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 1240 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:14:42,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2025-03-04 01:14:42,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 499. [2025-03-04 01:14:42,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 442 states have (on average 1.3800904977375565) internal successors, (610), 445 states have internal predecessors, (610), 50 states have call successors, (50), 6 states have call predecessors, (50), 6 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-04 01:14:42,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 710 transitions. [2025-03-04 01:14:42,142 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 710 transitions. Word has length 119 [2025-03-04 01:14:42,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:14:42,144 INFO L471 AbstractCegarLoop]: Abstraction has 499 states and 710 transitions. [2025-03-04 01:14:42,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:14:42,144 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 710 transitions. [2025-03-04 01:14:42,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-04 01:14:42,145 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:14:42,145 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:14:42,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2025-03-04 01:14:42,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:14:42,346 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:14:42,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:14:42,346 INFO L85 PathProgramCache]: Analyzing trace with hash -691692723, now seen corresponding path program 1 times [2025-03-04 01:14:42,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:14:42,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [549797961] [2025-03-04 01:14:42,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:42,346 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:14:42,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:14:42,348 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:14:42,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2025-03-04 01:14:42,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 01:14:42,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 01:14:42,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:42,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:42,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 01:14:42,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:14:43,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 01:14:43,473 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:14:43,473 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:14:43,610 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:14:43,610 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 16 treesize of output 19 [2025-03-04 01:14:43,938 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-04 01:14:43,938 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:14:43,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [549797961] [2025-03-04 01:14:43,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [549797961] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:14:43,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:14:43,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 17 [2025-03-04 01:14:43,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704405838] [2025-03-04 01:14:43,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:14:43,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:14:43,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:14:43,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:14:43,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2025-03-04 01:14:43,939 INFO L87 Difference]: Start difference. First operand 499 states and 710 transitions. Second operand has 9 states, 8 states have (on average 8.125) internal successors, (65), 9 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:14:44,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:14:44,556 INFO L93 Difference]: Finished difference Result 971 states and 1370 transitions. [2025-03-04 01:14:44,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 01:14:44,558 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.125) internal successors, (65), 9 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 119 [2025-03-04 01:14:44,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:14:44,560 INFO L225 Difference]: With dead ends: 971 [2025-03-04 01:14:44,560 INFO L226 Difference]: Without dead ends: 475 [2025-03-04 01:14:44,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2025-03-04 01:14:44,563 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 313 mSDsluCounter, 663 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:14:44,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 786 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:14:44,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2025-03-04 01:14:44,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 369. [2025-03-04 01:14:44,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 321 states have (on average 1.367601246105919) internal successors, (439), 323 states have internal predecessors, (439), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-04 01:14:44,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 523 transitions. [2025-03-04 01:14:44,584 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 523 transitions. Word has length 119 [2025-03-04 01:14:44,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:14:44,585 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 523 transitions. [2025-03-04 01:14:44,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.125) internal successors, (65), 9 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:14:44,586 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 523 transitions. [2025-03-04 01:14:44,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-04 01:14:44,588 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:14:44,588 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:14:44,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2025-03-04 01:14:44,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:14:44,789 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:14:44,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:14:44,789 INFO L85 PathProgramCache]: Analyzing trace with hash 384211349, now seen corresponding path program 1 times [2025-03-04 01:14:44,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:14:44,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1846916568] [2025-03-04 01:14:44,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:44,789 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:14:44,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:14:44,791 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:14:44,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2025-03-04 01:14:44,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-04 01:14:45,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-04 01:14:45,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:45,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:45,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 01:14:45,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:14:45,640 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 11 treesize of output 9 [2025-03-04 01:14:45,762 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:14:45,762 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:14:45,762 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:14:45,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1846916568] [2025-03-04 01:14:45,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1846916568] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:14:45,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:14:45,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:14:45,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797751020] [2025-03-04 01:14:45,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:14:45,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:14:45,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:14:45,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:14:45,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:14:45,763 INFO L87 Difference]: Start difference. First operand 369 states and 523 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:14:46,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:14:46,252 INFO L93 Difference]: Finished difference Result 698 states and 982 transitions. [2025-03-04 01:14:46,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:14:46,253 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 120 [2025-03-04 01:14:46,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:14:46,255 INFO L225 Difference]: With dead ends: 698 [2025-03-04 01:14:46,256 INFO L226 Difference]: Without dead ends: 373 [2025-03-04 01:14:46,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:14:46,257 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 300 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:14:46,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 1039 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:14:46,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2025-03-04 01:14:46,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 364. [2025-03-04 01:14:46,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 316 states have (on average 1.3639240506329113) internal successors, (431), 318 states have internal predecessors, (431), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-04 01:14:46,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 515 transitions. [2025-03-04 01:14:46,274 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 515 transitions. Word has length 120 [2025-03-04 01:14:46,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:14:46,275 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 515 transitions. [2025-03-04 01:14:46,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:14:46,275 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 515 transitions. [2025-03-04 01:14:46,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-04 01:14:46,277 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:14:46,278 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:14:46,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2025-03-04 01:14:46,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:14:46,479 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:14:46,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:14:46,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1206848473, now seen corresponding path program 1 times [2025-03-04 01:14:46,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:14:46,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2146661652] [2025-03-04 01:14:46,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:46,480 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:14:46,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:14:46,482 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:14:46,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2025-03-04 01:14:46,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 01:14:46,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 01:14:46,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:46,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:46,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 01:14:46,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:14:47,001 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:14:47,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 65 [2025-03-04 01:14:47,025 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2025-03-04 01:14:47,025 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:14:47,026 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:14:47,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2146661652] [2025-03-04 01:14:47,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2146661652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:14:47,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:14:47,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:14:47,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888139964] [2025-03-04 01:14:47,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:14:47,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:14:47,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:14:47,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:14:47,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:14:47,027 INFO L87 Difference]: Start difference. First operand 364 states and 515 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, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:14:49,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:14:50,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:14:50,206 INFO L93 Difference]: Finished difference Result 714 states and 1009 transitions. [2025-03-04 01:14:50,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:14:50,212 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, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 121 [2025-03-04 01:14:50,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:14:50,213 INFO L225 Difference]: With dead ends: 714 [2025-03-04 01:14:50,213 INFO L226 Difference]: Without dead ends: 368 [2025-03-04 01:14:50,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 116 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-03-04 01:14:50,214 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 136 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:14:50,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 487 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-03-04 01:14:50,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2025-03-04 01:14:50,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 364. [2025-03-04 01:14:50,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 316 states have (on average 1.3512658227848102) internal successors, (427), 318 states have internal predecessors, (427), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-04 01:14:50,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 511 transitions. [2025-03-04 01:14:50,244 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 511 transitions. Word has length 121 [2025-03-04 01:14:50,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:14:50,244 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 511 transitions. [2025-03-04 01:14:50,244 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, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:14:50,244 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 511 transitions. [2025-03-04 01:14:50,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-04 01:14:50,245 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:14:50,245 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:14:50,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2025-03-04 01:14:50,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:14:50,446 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:14:50,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:14:50,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1996434487, now seen corresponding path program 1 times [2025-03-04 01:14:50,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:14:50,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [712094047] [2025-03-04 01:14:50,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:50,447 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:14:50,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:14:50,449 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:14:50,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2025-03-04 01:14:50,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 01:14:50,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 01:14:50,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:50,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:50,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 01:14:50,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:14:50,994 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:14:50,994 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 173 treesize of output 65 [2025-03-04 01:14:51,010 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-04 01:14:51,010 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:14:51,010 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:14:51,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [712094047] [2025-03-04 01:14:51,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [712094047] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:14:51,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:14:51,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:14:51,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096045070] [2025-03-04 01:14:51,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:14:51,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:14:51,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:14:51,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:14:51,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:14:51,011 INFO L87 Difference]: Start difference. First operand 364 states and 511 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:14:53,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:14:53,423 INFO L93 Difference]: Finished difference Result 707 states and 991 transitions. [2025-03-04 01:14:53,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:14:53,430 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 123 [2025-03-04 01:14:53,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:14:53,431 INFO L225 Difference]: With dead ends: 707 [2025-03-04 01:14:53,431 INFO L226 Difference]: Without dead ends: 368 [2025-03-04 01:14:53,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 118 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-03-04 01:14:53,432 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 128 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:14:53,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 483 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-04 01:14:53,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2025-03-04 01:14:53,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 364. [2025-03-04 01:14:53,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 316 states have (on average 1.3386075949367089) internal successors, (423), 318 states have internal predecessors, (423), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-04 01:14:53,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 507 transitions. [2025-03-04 01:14:53,458 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 507 transitions. Word has length 123 [2025-03-04 01:14:53,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:14:53,458 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 507 transitions. [2025-03-04 01:14:53,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:14:53,458 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 507 transitions. [2025-03-04 01:14:53,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-04 01:14:53,459 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:14:53,459 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:14:53,473 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2025-03-04 01:14:53,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:14:53,660 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:14:53,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:14:53,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1536067929, now seen corresponding path program 1 times [2025-03-04 01:14:53,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:14:53,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [947044855] [2025-03-04 01:14:53,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:53,660 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:14:53,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:14:53,662 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:14:53,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2025-03-04 01:14:53,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-04 01:14:54,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-04 01:14:54,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:54,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:54,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 01:14:54,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:14:54,189 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:14:54,189 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 173 treesize of output 65 [2025-03-04 01:14:54,206 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-04 01:14:54,206 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:14:54,207 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:14:54,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [947044855] [2025-03-04 01:14:54,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [947044855] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:14:54,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:14:54,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:14:54,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004078819] [2025-03-04 01:14:54,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:14:54,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:14:54,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:14:54,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:14:54,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:14:54,207 INFO L87 Difference]: Start difference. First operand 364 states and 507 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:14:56,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:14:56,453 INFO L93 Difference]: Finished difference Result 700 states and 973 transitions. [2025-03-04 01:14:56,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:14:56,459 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 125 [2025-03-04 01:14:56,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:14:56,467 INFO L225 Difference]: With dead ends: 700 [2025-03-04 01:14:56,468 INFO L226 Difference]: Without dead ends: 368 [2025-03-04 01:14:56,468 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 120 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-03-04 01:14:56,468 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 119 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:14:56,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 479 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-04 01:14:56,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2025-03-04 01:14:56,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 364. [2025-03-04 01:14:56,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 316 states have (on average 1.3259493670886076) internal successors, (419), 318 states have internal predecessors, (419), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-04 01:14:56,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 503 transitions. [2025-03-04 01:14:56,484 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 503 transitions. Word has length 125 [2025-03-04 01:14:56,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:14:56,484 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 503 transitions. [2025-03-04 01:14:56,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:14:56,484 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 503 transitions. [2025-03-04 01:14:56,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-04 01:14:56,485 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:14:56,485 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:14:56,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2025-03-04 01:14:56,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:14:56,686 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:14:56,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:14:56,686 INFO L85 PathProgramCache]: Analyzing trace with hash 2077150281, now seen corresponding path program 1 times [2025-03-04 01:14:56,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:14:56,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1395675450] [2025-03-04 01:14:56,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:14:56,686 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:14:56,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:14:56,688 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:14:56,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2025-03-04 01:14:56,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-04 01:14:57,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-04 01:14:57,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:14:57,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:14:57,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 01:14:57,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:14:57,244 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:14:57,245 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 173 treesize of output 65 [2025-03-04 01:14:57,264 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-04 01:14:57,264 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:14:57,264 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:14:57,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1395675450] [2025-03-04 01:14:57,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1395675450] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:14:57,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:14:57,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:14:57,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391473437] [2025-03-04 01:14:57,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:14:57,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:14:57,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:14:57,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:14:57,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:14:57,265 INFO L87 Difference]: Start difference. First operand 364 states and 503 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:15:00,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:15:00,146 INFO L93 Difference]: Finished difference Result 693 states and 955 transitions. [2025-03-04 01:15:00,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:15:00,152 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 127 [2025-03-04 01:15:00,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:15:00,154 INFO L225 Difference]: With dead ends: 693 [2025-03-04 01:15:00,154 INFO L226 Difference]: Without dead ends: 368 [2025-03-04 01:15:00,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 122 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-03-04 01:15:00,154 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 109 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-04 01:15:00,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 472 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-04 01:15:00,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2025-03-04 01:15:00,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 364. [2025-03-04 01:15:00,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 316 states have (on average 1.3132911392405062) internal successors, (415), 318 states have internal predecessors, (415), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-04 01:15:00,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 499 transitions. [2025-03-04 01:15:00,169 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 499 transitions. Word has length 127 [2025-03-04 01:15:00,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:15:00,169 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 499 transitions. [2025-03-04 01:15:00,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:15:00,170 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 499 transitions. [2025-03-04 01:15:00,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 01:15:00,171 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:15:00,171 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:15:00,185 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2025-03-04 01:15:00,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:15:00,372 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:15:00,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:15:00,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1206400729, now seen corresponding path program 1 times [2025-03-04 01:15:00,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:15:00,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [598039043] [2025-03-04 01:15:00,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:15:00,372 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:15:00,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:15:00,374 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:15:00,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2025-03-04 01:15:00,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 01:15:00,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 01:15:00,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:15:00,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:15:00,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-04 01:15:00,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:15:03,216 INFO L349 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2025-03-04 01:15:03,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2025-03-04 01:15:03,427 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 29 treesize of output 17 [2025-03-04 01:15:03,597 INFO L349 Elim1Store]: treesize reduction 26, result has 36.6 percent of original size [2025-03-04 01:15:03,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 37 [2025-03-04 01:15:04,057 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 8 proven. 143 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-03-04 01:15:04,057 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:15:04,349 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:15:04,350 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:15:04,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [598039043] [2025-03-04 01:15:04,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [598039043] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:15:04,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:15:04,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [24] total 29 [2025-03-04 01:15:04,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033633190] [2025-03-04 01:15:04,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:15:04,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:15:04,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:15:04,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:15:04,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=728, Unknown=0, NotChecked=0, Total=812 [2025-03-04 01:15:04,351 INFO L87 Difference]: Start difference. First operand 364 states and 499 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:15:04,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:15:04,586 INFO L93 Difference]: Finished difference Result 667 states and 920 transitions. [2025-03-04 01:15:04,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:15:04,587 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 129 [2025-03-04 01:15:04,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:15:04,588 INFO L225 Difference]: With dead ends: 667 [2025-03-04 01:15:04,588 INFO L226 Difference]: Without dead ends: 452 [2025-03-04 01:15:04,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=97, Invalid=833, Unknown=0, NotChecked=0, Total=930 [2025-03-04 01:15:04,589 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 220 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:15:04,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 777 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:15:04,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2025-03-04 01:15:04,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 449. [2025-03-04 01:15:04,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 390 states have (on average 1.317948717948718) internal successors, (514), 393 states have internal predecessors, (514), 52 states have call successors, (52), 6 states have call predecessors, (52), 6 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-04 01:15:04,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 618 transitions. [2025-03-04 01:15:04,605 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 618 transitions. Word has length 129 [2025-03-04 01:15:04,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:15:04,605 INFO L471 AbstractCegarLoop]: Abstraction has 449 states and 618 transitions. [2025-03-04 01:15:04,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:15:04,605 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 618 transitions. [2025-03-04 01:15:04,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-04 01:15:04,606 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:15:04,606 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:15:04,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2025-03-04 01:15:04,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:15:04,807 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:15:04,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:15:04,808 INFO L85 PathProgramCache]: Analyzing trace with hash 283148058, now seen corresponding path program 1 times [2025-03-04 01:15:04,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:15:04,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1298046913] [2025-03-04 01:15:04,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:15:04,809 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:15:04,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:15:04,814 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:15:04,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2025-03-04 01:15:04,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-04 01:15:05,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-04 01:15:05,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:15:05,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:15:05,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-04 01:15:05,286 INFO L279 TraceCheckSpWp]: Computing forward predicates...