./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-65.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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-a_file-65.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 1909061afd980a39396ef4a3c6a4eb0a48d7b8752c9988e586de4638f163afa1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:26:24,570 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:26:24,631 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:26:24,636 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:26:24,636 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:26:24,655 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:26:24,656 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:26:24,656 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:26:24,657 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:26:24,657 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:26:24,657 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:26:24,657 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:26:24,658 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:26:24,658 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:26:24,658 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:26:24,658 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:26:24,658 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:26:24,658 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:26:24,658 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:26:24,658 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:26:24,659 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:26:24,659 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:26:24,659 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:26:24,659 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:26:24,659 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:26:24,659 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:26:24,659 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:26:24,659 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:26:24,659 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:26:24,659 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:26:24,659 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:26:24,659 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:26:24,660 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:26:24,660 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:26:24,660 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:26:24,660 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:26:24,660 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:26:24,660 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:26:24,660 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:26:24,660 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:26:24,661 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:26:24,661 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:26:24,661 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:26:24,661 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 -> 1909061afd980a39396ef4a3c6a4eb0a48d7b8752c9988e586de4638f163afa1 [2025-03-17 05:26:24,874 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:26:24,879 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:26:24,880 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:26:24,881 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:26:24,881 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:26:24,882 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-65.i [2025-03-17 05:26:26,149 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c0206326/89e8f17607e14ef19ec815d7b351960c/FLAG4747a719b [2025-03-17 05:26:26,410 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:26:26,411 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-65.i [2025-03-17 05:26:26,420 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c0206326/89e8f17607e14ef19ec815d7b351960c/FLAG4747a719b [2025-03-17 05:26:26,435 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c0206326/89e8f17607e14ef19ec815d7b351960c [2025-03-17 05:26:26,437 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:26:26,438 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:26:26,439 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:26:26,439 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:26:26,443 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:26:26,445 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:26:26" (1/1) ... [2025-03-17 05:26:26,446 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7205665f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:26:26, skipping insertion in model container [2025-03-17 05:26:26,446 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:26:26" (1/1) ... [2025-03-17 05:26:26,460 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:26:26,568 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-a_file-65.i[916,929] [2025-03-17 05:26:26,621 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:26:26,628 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:26:26,636 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-a_file-65.i[916,929] [2025-03-17 05:26:26,669 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:26:26,682 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:26:26,683 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:26:26 WrapperNode [2025-03-17 05:26:26,684 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:26:26,684 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:26:26,685 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:26:26,685 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:26:26,689 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:26:26" (1/1) ... [2025-03-17 05:26:26,696 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:26:26" (1/1) ... [2025-03-17 05:26:26,728 INFO L138 Inliner]: procedures = 29, calls = 151, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 487 [2025-03-17 05:26:26,728 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:26:26,728 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:26:26,728 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:26:26,729 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:26:26,734 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:26:26" (1/1) ... [2025-03-17 05:26:26,735 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:26:26" (1/1) ... [2025-03-17 05:26:26,738 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:26:26" (1/1) ... [2025-03-17 05:26:26,756 INFO L175 MemorySlicer]: Split 123 memory accesses to 7 slices as follows [2, 8, 44, 29, 9, 3, 28]. 36 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 5, 2, 2, 1, 3]. The 16 writes are split as follows [0, 1, 6, 3, 2, 1, 3]. [2025-03-17 05:26:26,756 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:26:26" (1/1) ... [2025-03-17 05:26:26,756 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:26:26" (1/1) ... [2025-03-17 05:26:26,772 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:26:26" (1/1) ... [2025-03-17 05:26:26,773 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:26:26" (1/1) ... [2025-03-17 05:26:26,774 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:26:26" (1/1) ... [2025-03-17 05:26:26,775 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:26:26" (1/1) ... [2025-03-17 05:26:26,782 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:26:26,783 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:26:26,783 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:26:26,783 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:26:26,783 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:26:26" (1/1) ... [2025-03-17 05:26:26,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:26:26,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:26:26,806 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-17 05:26:26,808 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-17 05:26:26,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:26:26,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 05:26:26,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 05:26:26,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 05:26:26,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 05:26:26,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 05:26:26,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-17 05:26:26,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-17 05:26:26,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-17 05:26:26,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-17 05:26:26,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-17 05:26:26,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-17 05:26:26,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-17 05:26:26,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-03-17 05:26:26,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-03-17 05:26:26,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-17 05:26:26,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-17 05:26:26,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-17 05:26:26,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-17 05:26:26,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-17 05:26:26,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-03-17 05:26:26,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2025-03-17 05:26:26,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 05:26:26,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 05:26:26,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 05:26:26,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 05:26:26,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 05:26:26,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-17 05:26:26,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-17 05:26:26,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-17 05:26:26,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-17 05:26:26,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-17 05:26:26,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-17 05:26:26,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-17 05:26:26,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-03-17 05:26:26,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2025-03-17 05:26:26,824 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:26:26,824 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:26:26,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 05:26:26,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 05:26:26,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 05:26:26,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 05:26:26,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 05:26:26,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-17 05:26:26,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-17 05:26:26,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:26:26,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:26:26,932 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:26:26,933 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:26:27,266 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L92: havoc property_#t~ite98#1;havoc property_#t~mem86#1;havoc property_#t~ite92#1;havoc property_#t~mem91#1;havoc property_#t~mem87#1;havoc property_#t~ite90#1;havoc property_#t~mem88#1;havoc property_#t~mem89#1;havoc property_#t~mem97#1;havoc property_#t~mem93#1;havoc property_#t~ite96#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~ite107#1;havoc property_#t~mem106#1;havoc property_#t~mem101#1;havoc property_#t~ite103#1;havoc property_#t~mem102#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~short108#1;havoc property_#t~mem109#1;havoc property_#t~ite126#1;havoc property_#t~mem112#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~ite118#1;havoc property_#t~mem117#1;havoc property_#t~mem113#1;havoc property_#t~ite115#1;havoc property_#t~mem114#1;havoc property_#t~mem116#1;havoc property_#t~mem119#1;havoc property_#t~mem120#1;havoc property_#t~ite125#1;havoc property_#t~mem124#1;havoc property_#t~mem123#1;havoc property_#t~mem121#1;havoc property_#t~mem122#1;havoc property_#t~short127#1;havoc property_#t~mem129#1;havoc property_#t~mem128#1;havoc property_#t~short130#1;havoc property_#t~mem132#1;havoc property_#t~mem131#1;havoc property_#t~short133#1;havoc property_#t~mem135#1;havoc property_#t~mem134#1;havoc property_#t~short136#1; [2025-03-17 05:26:27,308 INFO L? ?]: Removed 115 outVars from TransFormulas that were not future-live. [2025-03-17 05:26:27,309 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:26:27,316 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:26:27,318 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:26:27,318 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:26:27 BoogieIcfgContainer [2025-03-17 05:26:27,319 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:26:27,321 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:26:27,321 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:26:27,324 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:26:27,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:26:26" (1/3) ... [2025-03-17 05:26:27,324 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21777de2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:26:27, skipping insertion in model container [2025-03-17 05:26:27,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:26:26" (2/3) ... [2025-03-17 05:26:27,325 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21777de2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:26:27, skipping insertion in model container [2025-03-17 05:26:27,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:26:27" (3/3) ... [2025-03-17 05:26:27,326 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-65.i [2025-03-17 05:26:27,336 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:26:27,337 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-65.i that has 2 procedures, 107 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:26:27,373 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:26:27,380 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;@6d48ac5d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:26:27,380 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:26:27,382 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 93 states have (on average 1.4731182795698925) internal successors, (137), 94 states have internal predecessors, (137), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 05:26:27,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-17 05:26:27,389 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:26:27,389 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:26:27,389 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:26:27,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:26:27,393 INFO L85 PathProgramCache]: Analyzing trace with hash 757387111, now seen corresponding path program 1 times [2025-03-17 05:26:27,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:26:27,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832274378] [2025-03-17 05:26:27,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:26:27,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:26:27,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-17 05:26:27,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-17 05:26:27,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:26:27,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:26:27,624 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-17 05:26:27,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:26:27,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832274378] [2025-03-17 05:26:27,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832274378] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:26:27,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807710884] [2025-03-17 05:26:27,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:26:27,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:26:27,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:26:27,629 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-17 05:26:27,630 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-17 05:26:27,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-17 05:26:27,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-17 05:26:27,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:26:27,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:26:27,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:26:27,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:26:27,854 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-17 05:26:27,854 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:26:27,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807710884] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:26:27,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:26:27,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:26:27,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480888880] [2025-03-17 05:26:27,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:26:27,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:26:27,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:26:27,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:26:27,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:26:27,877 INFO L87 Difference]: Start difference. First operand has 107 states, 93 states have (on average 1.4731182795698925) internal successors, (137), 94 states have internal predecessors, (137), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 05:26:27,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:26:27,894 INFO L93 Difference]: Finished difference Result 211 states and 327 transitions. [2025-03-17 05:26:27,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:26:27,896 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 108 [2025-03-17 05:26:27,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:26:27,901 INFO L225 Difference]: With dead ends: 211 [2025-03-17 05:26:27,901 INFO L226 Difference]: Without dead ends: 105 [2025-03-17 05:26:27,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 109 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-17 05:26:27,908 INFO L435 NwaCegarLoop]: 153 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, 153 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-17 05:26:27,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:26:27,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-17 05:26:27,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2025-03-17 05:26:27,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 92 states have (on average 1.423913043478261) internal successors, (131), 92 states have internal predecessors, (131), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 05:26:27,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 153 transitions. [2025-03-17 05:26:27,937 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 153 transitions. Word has length 108 [2025-03-17 05:26:27,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:26:27,937 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 153 transitions. [2025-03-17 05:26:27,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 05:26:27,937 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 153 transitions. [2025-03-17 05:26:27,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-17 05:26:27,940 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:26:27,941 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:26:27,949 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-17 05:26:28,141 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-17 05:26:28,141 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:26:28,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:26:28,142 INFO L85 PathProgramCache]: Analyzing trace with hash 2073987370, now seen corresponding path program 1 times [2025-03-17 05:26:28,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:26:28,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643258557] [2025-03-17 05:26:28,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:26:28,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:26:28,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-17 05:26:28,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-17 05:26:28,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:26:28,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:26:28,401 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 05:26:28,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:26:28,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643258557] [2025-03-17 05:26:28,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643258557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:26:28,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:26:28,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:26:28,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308361071] [2025-03-17 05:26:28,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:26:28,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:26:28,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:26:28,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:26:28,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:26:28,407 INFO L87 Difference]: Start difference. First operand 105 states and 153 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 05:26:28,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:26:28,440 INFO L93 Difference]: Finished difference Result 211 states and 308 transitions. [2025-03-17 05:26:28,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:26:28,441 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 108 [2025-03-17 05:26:28,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:26:28,442 INFO L225 Difference]: With dead ends: 211 [2025-03-17 05:26:28,443 INFO L226 Difference]: Without dead ends: 107 [2025-03-17 05:26:28,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:26:28,445 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:26:28,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 442 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:26:28,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-17 05:26:28,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2025-03-17 05:26:28,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 94 states have internal predecessors, (133), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 05:26:28,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 155 transitions. [2025-03-17 05:26:28,460 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 155 transitions. Word has length 108 [2025-03-17 05:26:28,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:26:28,461 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 155 transitions. [2025-03-17 05:26:28,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 05:26:28,461 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 155 transitions. [2025-03-17 05:26:28,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-17 05:26:28,462 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:26:28,462 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:26:28,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 05:26:28,462 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:26:28,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:26:28,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1612903063, now seen corresponding path program 1 times [2025-03-17 05:26:28,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:26:28,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748443819] [2025-03-17 05:26:28,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:26:28,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:26:28,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-17 05:26:28,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-17 05:26:28,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:26:28,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:26:28,718 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-17 05:26:28,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:26:28,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748443819] [2025-03-17 05:26:28,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748443819] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:26:28,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277688854] [2025-03-17 05:26:28,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:26:28,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:26:28,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:26:28,721 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-17 05:26:28,722 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-17 05:26:28,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-17 05:26:28,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-17 05:26:28,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:26:28,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:26:28,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:26:28,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:26:28,922 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 05:26:28,922 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:26:28,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1277688854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:26:28,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:26:28,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2025-03-17 05:26:28,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367364439] [2025-03-17 05:26:28,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:26:28,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:26:28,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:26:28,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:26:28,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:26:28,924 INFO L87 Difference]: Start difference. First operand 107 states and 155 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:26:28,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:26:28,949 INFO L93 Difference]: Finished difference Result 216 states and 313 transitions. [2025-03-17 05:26:28,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:26:28,951 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 108 [2025-03-17 05:26:28,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:26:28,952 INFO L225 Difference]: With dead ends: 216 [2025-03-17 05:26:28,952 INFO L226 Difference]: Without dead ends: 110 [2025-03-17 05:26:28,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:26:28,953 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 1 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:26:28,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 439 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:26:28,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-17 05:26:28,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2025-03-17 05:26:28,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 96 states have (on average 1.40625) internal successors, (135), 96 states have internal predecessors, (135), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 05:26:28,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 157 transitions. [2025-03-17 05:26:28,967 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 157 transitions. Word has length 108 [2025-03-17 05:26:28,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:26:28,967 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 157 transitions. [2025-03-17 05:26:28,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:26:28,967 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 157 transitions. [2025-03-17 05:26:28,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-17 05:26:28,968 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:26:28,968 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:26:28,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 05:26:29,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-17 05:26:29,169 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:26:29,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:26:29,170 INFO L85 PathProgramCache]: Analyzing trace with hash 874609770, now seen corresponding path program 1 times [2025-03-17 05:26:29,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:26:29,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341880576] [2025-03-17 05:26:29,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:26:29,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:26:29,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-17 05:26:29,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-17 05:26:29,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:26:29,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:26:29,368 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-17 05:26:29,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:26:29,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341880576] [2025-03-17 05:26:29,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341880576] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:26:29,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1242427392] [2025-03-17 05:26:29,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:26:29,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:26:29,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:26:29,370 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:26:29,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 05:26:29,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-17 05:26:29,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-17 05:26:29,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:26:29,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:26:29,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:26:29,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:26:29,564 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 05:26:29,565 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:26:29,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1242427392] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:26:29,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:26:29,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2025-03-17 05:26:29,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756795106] [2025-03-17 05:26:29,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:26:29,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:26:29,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:26:29,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:26:29,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:26:29,567 INFO L87 Difference]: Start difference. First operand 109 states and 157 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:26:29,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:26:29,594 INFO L93 Difference]: Finished difference Result 220 states and 317 transitions. [2025-03-17 05:26:29,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:26:29,596 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 108 [2025-03-17 05:26:29,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:26:29,597 INFO L225 Difference]: With dead ends: 220 [2025-03-17 05:26:29,597 INFO L226 Difference]: Without dead ends: 112 [2025-03-17 05:26:29,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:26:29,598 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 1 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:26:29,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 440 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:26:29,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-17 05:26:29,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2025-03-17 05:26:29,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 98 states have (on average 1.3979591836734695) internal successors, (137), 98 states have internal predecessors, (137), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 05:26:29,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 159 transitions. [2025-03-17 05:26:29,608 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 159 transitions. Word has length 108 [2025-03-17 05:26:29,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:26:29,608 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 159 transitions. [2025-03-17 05:26:29,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:26:29,608 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 159 transitions. [2025-03-17 05:26:29,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-17 05:26:29,609 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:26:29,609 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:26:29,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 05:26:29,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:26:29,810 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:26:29,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:26:29,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1762113451, now seen corresponding path program 1 times [2025-03-17 05:26:29,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:26:29,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610157377] [2025-03-17 05:26:29,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:26:29,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:26:29,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-17 05:26:29,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-17 05:26:29,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:26:29,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:26:29,988 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-17 05:26:29,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:26:29,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610157377] [2025-03-17 05:26:29,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610157377] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:26:29,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732900967] [2025-03-17 05:26:29,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:26:29,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:26:29,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:26:29,991 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:26:29,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 05:26:30,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-17 05:26:30,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-17 05:26:30,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:26:30,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:26:30,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:26:30,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:26:30,175 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 05:26:30,175 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:26:30,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [732900967] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:26:30,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:26:30,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2025-03-17 05:26:30,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288934101] [2025-03-17 05:26:30,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:26:30,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:26:30,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:26:30,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:26:30,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:26:30,177 INFO L87 Difference]: Start difference. First operand 111 states and 159 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:26:30,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:26:30,199 INFO L93 Difference]: Finished difference Result 224 states and 321 transitions. [2025-03-17 05:26:30,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:26:30,201 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 108 [2025-03-17 05:26:30,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:26:30,202 INFO L225 Difference]: With dead ends: 224 [2025-03-17 05:26:30,202 INFO L226 Difference]: Without dead ends: 114 [2025-03-17 05:26:30,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:26:30,203 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 1 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:26:30,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 442 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:26:30,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-17 05:26:30,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2025-03-17 05:26:30,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 100 states have (on average 1.39) internal successors, (139), 100 states have internal predecessors, (139), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 05:26:30,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 161 transitions. [2025-03-17 05:26:30,211 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 161 transitions. Word has length 108 [2025-03-17 05:26:30,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:26:30,211 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 161 transitions. [2025-03-17 05:26:30,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:26:30,211 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 161 transitions. [2025-03-17 05:26:30,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-17 05:26:30,212 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:26:30,212 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:26:30,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 05:26:30,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:26:30,413 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:26:30,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:26:30,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1763036972, now seen corresponding path program 1 times [2025-03-17 05:26:30,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:26:30,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012504413] [2025-03-17 05:26:30,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:26:30,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:26:30,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-17 05:26:30,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-17 05:26:30,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:26:30,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:26:30,556 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-17 05:26:30,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:26:30,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012504413] [2025-03-17 05:26:30,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012504413] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:26:30,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108166539] [2025-03-17 05:26:30,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:26:30,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:26:30,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:26:30,558 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:26:30,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 05:26:30,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-17 05:26:30,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-17 05:26:30,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:26:30,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:26:30,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:26:30,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:26:30,736 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 05:26:30,737 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:26:30,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108166539] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:26:30,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:26:30,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-03-17 05:26:30,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339147030] [2025-03-17 05:26:30,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:26:30,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:26:30,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:26:30,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:26:30,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:26:30,739 INFO L87 Difference]: Start difference. First operand 113 states and 161 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:26:30,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:26:30,766 INFO L93 Difference]: Finished difference Result 228 states and 325 transitions. [2025-03-17 05:26:30,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:26:30,767 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 108 [2025-03-17 05:26:30,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:26:30,767 INFO L225 Difference]: With dead ends: 228 [2025-03-17 05:26:30,767 INFO L226 Difference]: Without dead ends: 116 [2025-03-17 05:26:30,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:26:30,768 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:26:30,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 585 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:26:30,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-17 05:26:30,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2025-03-17 05:26:30,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 103 states have (on average 1.3786407766990292) internal successors, (142), 103 states have internal predecessors, (142), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 05:26:30,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 164 transitions. [2025-03-17 05:26:30,776 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 164 transitions. Word has length 108 [2025-03-17 05:26:30,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:26:30,776 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 164 transitions. [2025-03-17 05:26:30,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:26:30,778 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 164 transitions. [2025-03-17 05:26:30,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-17 05:26:30,779 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:26:30,779 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:26:30,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 05:26:30,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:26:30,980 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:26:30,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:26:30,980 INFO L85 PathProgramCache]: Analyzing trace with hash -982333292, now seen corresponding path program 1 times [2025-03-17 05:26:30,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:26:30,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043858188] [2025-03-17 05:26:30,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:26:30,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:26:31,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-17 05:26:31,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-17 05:26:31,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:26:31,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:26:31,480 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 05:26:31,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:26:31,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043858188] [2025-03-17 05:26:31,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043858188] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:26:31,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:26:31,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:26:31,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740063883] [2025-03-17 05:26:31,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:26:31,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:26:31,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:26:31,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:26:31,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:26:31,482 INFO L87 Difference]: Start difference. First operand 116 states and 164 transitions. Second operand has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 05:26:31,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:26:31,535 INFO L93 Difference]: Finished difference Result 284 states and 397 transitions. [2025-03-17 05:26:31,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:26:31,536 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 108 [2025-03-17 05:26:31,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:26:31,537 INFO L225 Difference]: With dead ends: 284 [2025-03-17 05:26:31,538 INFO L226 Difference]: Without dead ends: 169 [2025-03-17 05:26:31,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:26:31,539 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 118 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:26:31,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 570 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:26:31,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-03-17 05:26:31,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 118. [2025-03-17 05:26:31,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 105 states have (on average 1.3714285714285714) internal successors, (144), 105 states have internal predecessors, (144), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 05:26:31,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 166 transitions. [2025-03-17 05:26:31,548 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 166 transitions. Word has length 108 [2025-03-17 05:26:31,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:26:31,549 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 166 transitions. [2025-03-17 05:26:31,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 05:26:31,549 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 166 transitions. [2025-03-17 05:26:31,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-17 05:26:31,549 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:26:31,549 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:26:31,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 05:26:31,550 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:26:31,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:26:31,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1916134259, now seen corresponding path program 1 times [2025-03-17 05:26:31,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:26:31,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114540658] [2025-03-17 05:26:31,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:26:31,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:26:31,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-17 05:26:31,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-17 05:26:31,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:26:31,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:26:31,582 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 05:26:31,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-17 05:26:31,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-17 05:26:31,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:26:31,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:26:31,640 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 05:26:31,641 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 05:26:31,641 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 05:26:31,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 05:26:31,645 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:26:31,722 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 05:26:31,728 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 05:26:31 BoogieIcfgContainer [2025-03-17 05:26:31,728 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 05:26:31,729 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 05:26:31,729 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 05:26:31,729 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 05:26:31,730 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:26:27" (3/4) ... [2025-03-17 05:26:31,731 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 05:26:31,732 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 05:26:31,733 INFO L158 Benchmark]: Toolchain (without parser) took 5294.23ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 112.7MB in the beginning and 180.6MB in the end (delta: -67.9MB). Peak memory consumption was 191.7MB. Max. memory is 16.1GB. [2025-03-17 05:26:31,733 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 122.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:26:31,733 INFO L158 Benchmark]: CACSL2BoogieTranslator took 244.81ms. Allocated memory is still 142.6MB. Free memory was 112.7MB in the beginning and 98.0MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 05:26:31,733 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.55ms. Allocated memory is still 142.6MB. Free memory was 98.0MB in the beginning and 94.8MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:26:31,734 INFO L158 Benchmark]: Boogie Preprocessor took 53.73ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 90.4MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 05:26:31,734 INFO L158 Benchmark]: IcfgBuilder took 536.18ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 58.2MB in the end (delta: 32.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 05:26:31,734 INFO L158 Benchmark]: TraceAbstraction took 4407.65ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 57.7MB in the beginning and 180.7MB in the end (delta: -123.0MB). Peak memory consumption was 141.3MB. Max. memory is 16.1GB. [2025-03-17 05:26:31,734 INFO L158 Benchmark]: Witness Printer took 3.02ms. Allocated memory is still 402.7MB. Free memory was 180.7MB in the beginning and 180.6MB in the end (delta: 81.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:26:31,735 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 122.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 244.81ms. Allocated memory is still 142.6MB. Free memory was 112.7MB in the beginning and 98.0MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.55ms. Allocated memory is still 142.6MB. Free memory was 98.0MB in the beginning and 94.8MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 53.73ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 90.4MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 536.18ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 58.2MB in the end (delta: 32.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4407.65ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 57.7MB in the beginning and 180.7MB in the end (delta: -123.0MB). Peak memory consumption was 141.3MB. Max. memory is 16.1GB. * Witness Printer took 3.02ms. Allocated memory is still 402.7MB. Free memory was 180.7MB in the beginning and 180.6MB in the end (delta: 81.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 60, overapproximation of someBinaryFLOATComparisonOperation at line 92, overapproximation of someBinaryFLOATComparisonOperation at line 80, overapproximation of someBinaryFLOATComparisonOperation at line 59, overapproximation of someBinaryFLOATComparisonOperation at line 80, overapproximation of someBinaryFLOATComparisonOperation at line 92, overapproximation of someBinaryDOUBLEComparisonOperation at line 92, overapproximation of someBinaryDOUBLEComparisonOperation at line 44, overapproximation of someBinaryDOUBLEComparisonOperation at line 72, overapproximation of someBinaryDOUBLEComparisonOperation at line 74, overapproximation of someBinaryDOUBLEComparisonOperation at line 78, overapproximation of someBinaryDOUBLEComparisonOperation at line 72, overapproximation of someBinaryDOUBLEComparisonOperation at line 74, overapproximation of someBinaryDOUBLEComparisonOperation at line 76, overapproximation of someBinaryDOUBLEComparisonOperation at line 76, overapproximation of someBinaryDOUBLEComparisonOperation at line 78, overapproximation of someBinaryDOUBLEComparisonOperation at line 63, overapproximation of someUnaryFLOAToperation at line 92. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 1 }; [L25-L27] double double_Array_0[5] = { 25.25, 100.5, 63.6, 0.0, 0.8 }; [L25-L27] double double_Array_0[5] = { 25.25, 100.5, 63.6, 0.0, 0.8 }; [L25-L27] double double_Array_0[5] = { 25.25, 100.5, 63.6, 0.0, 0.8 }; [L25-L27] double double_Array_0[5] = { 25.25, 100.5, 63.6, 0.0, 0.8 }; [L25-L27] double double_Array_0[5] = { 25.25, 100.5, 63.6, 0.0, 0.8 }; [L25-L27] double double_Array_0[5] = { 25.25, 100.5, 63.6, 0.0, 0.8 }; [L28-L30] float float_Array_0[2] = { 8.2, 1000000000.1 }; [L28-L30] float float_Array_0[2] = { 8.2, 1000000000.1 }; [L28-L30] float float_Array_0[2] = { 8.2, 1000000000.1 }; [L31-L33] signed char signed_char_Array_0[2] = { -8, 8 }; [L31-L33] signed char signed_char_Array_0[2] = { -8, 8 }; [L31-L33] signed char signed_char_Array_0[2] = { -8, 8 }; [L34-L36] signed long int signed_long_int_Array_0[1] = { -32 }; [L34-L36] signed long int signed_long_int_Array_0[1] = { -32 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[3] = { 0, 2, 50 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[3] = { 0, 2, 50 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[3] = { 0, 2, 50 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[3] = { 0, 2, 50 }; [L40] double last_1_double_Array_0_1_ = 100.5; [L96] isInitial = 1 [L97] FCALL initially() [L98] COND TRUE 1 [L99] CALL updateLastVariables() [L89] EXPR double_Array_0[1] [L89] last_1_double_Array_0_1_ = double_Array_0[1] [L99] RET updateLastVariables() [L100] CALL updateVariables() [L68] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L69] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L69] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L69] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L70] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L70] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L70] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L71] double_Array_0[0] = __VERIFIER_nondet_double() [L72] EXPR double_Array_0[0] [L72] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L72] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F [L72] EXPR double_Array_0[0] [L72] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L72] 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}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L72] 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}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L72] 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}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L72] 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}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L73] double_Array_0[2] = __VERIFIER_nondet_double() [L74] EXPR double_Array_0[2] [L74] EXPR double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] EXPR double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F [L74] EXPR double_Array_0[2] [L74] EXPR double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] EXPR (double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854765600e+12F && double_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] EXPR (double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854765600e+12F && double_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] CALL assume_abort_if_not((double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854765600e+12F && double_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] RET assume_abort_if_not((double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854765600e+12F && double_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L75] double_Array_0[3] = __VERIFIER_nondet_double() [L76] EXPR double_Array_0[3] [L76] EXPR double_Array_0[3] >= 4611686.018427382800e+12F && double_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] EXPR double_Array_0[3] >= 4611686.018427382800e+12F && double_Array_0[3] <= -1.0e-20F [L76] EXPR double_Array_0[3] [L76] EXPR double_Array_0[3] >= 4611686.018427382800e+12F && double_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] EXPR (double_Array_0[3] >= 4611686.018427382800e+12F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854765600e+12F && double_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] EXPR (double_Array_0[3] >= 4611686.018427382800e+12F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854765600e+12F && double_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] CALL assume_abort_if_not((double_Array_0[3] >= 4611686.018427382800e+12F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854765600e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] RET assume_abort_if_not((double_Array_0[3] >= 4611686.018427382800e+12F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854765600e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] double_Array_0[4] = __VERIFIER_nondet_double() [L78] EXPR double_Array_0[4] [L78] EXPR double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] EXPR double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F [L78] EXPR double_Array_0[4] [L78] EXPR double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] EXPR (double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 4611686.018427382800e+12F && double_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] EXPR (double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 4611686.018427382800e+12F && double_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] CALL assume_abort_if_not((double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 4611686.018427382800e+12F && double_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] RET assume_abort_if_not((double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 4611686.018427382800e+12F && double_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] float_Array_0[0] = __VERIFIER_nondet_float() [L80] EXPR float_Array_0[0] [L80] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F [L80] EXPR float_Array_0[0] [L80] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] EXPR (float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] EXPR (float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] CALL assume_abort_if_not((float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] RET assume_abort_if_not((float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] signed_char_Array_0[1] = __VERIFIER_nondet_char() [L82] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] CALL assume_abort_if_not(signed_char_Array_0[1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] RET assume_abort_if_not(signed_char_Array_0[1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] CALL assume_abort_if_not(signed_char_Array_0[1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] RET assume_abort_if_not(signed_char_Array_0[1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] unsigned_short_int_Array_0[2] = __VERIFIER_nondet_ushort() [L85] EXPR unsigned_short_int_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L85] CALL assume_abort_if_not(unsigned_short_int_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L85] RET assume_abort_if_not(unsigned_short_int_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] EXPR unsigned_short_int_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] CALL assume_abort_if_not(unsigned_short_int_Array_0[2] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] RET assume_abort_if_not(unsigned_short_int_Array_0[2] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] RET updateVariables() [L101] CALL step() [L44] COND TRUE 0.625f > last_1_double_Array_0_1_ [L45] BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L45] COND FALSE !(BOOL_unsigned_char_Array_0[0]) [L51] EXPR signed_char_Array_0[1] [L51] signed_char_Array_0[0] = signed_char_Array_0[1] [L52] EXPR unsigned_short_int_Array_0[2] [L52] unsigned_short_int_Array_0[1] = unsigned_short_int_Array_0[2] [L53] EXPR unsigned_short_int_Array_0[2] [L53] unsigned_short_int_Array_0[0] = unsigned_short_int_Array_0[2] [L54] BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L54] COND FALSE !(BOOL_unsigned_char_Array_0[0]) [L59] EXPR float_Array_0[1] [L59] EXPR float_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L59] COND TRUE float_Array_0[1] <= float_Array_0[1] [L60] EXPR double_Array_0[2] [L60] EXPR double_Array_0[3] [L60] EXPR double_Array_0[4] [L60] double_Array_0[1] = (double_Array_0[2] - (double_Array_0[3] - double_Array_0[4])) [L63] EXPR float_Array_0[0] [L63] EXPR double_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L63] COND FALSE !(float_Array_0[0] > double_Array_0[1]) [L101] RET step() [L102] CALL, EXPR property() [L92] EXPR (0.625f > last_1_double_Array_0_1_) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))))) : 1) : (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))))) [L92] EXPR float_Array_0[1] [L92] EXPR float_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] EXPR ((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]) [L92] EXPR float_Array_0[0] [L92] EXPR ((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] EXPR (0.625f > last_1_double_Array_0_1_) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))))) : 1) : (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] EXPR ((0.625f > last_1_double_Array_0_1_) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))))) : 1) : (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))))) && ((float_Array_0[0] > double_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_short_int_Array_0[0]) > (-64)) ? (unsigned_short_int_Array_0[0]) : (-64))) + ((unsigned_short_int_Array_0[0] + -2) + unsigned_short_int_Array_0[1])))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] EXPR ((0.625f > last_1_double_Array_0_1_) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))))) : 1) : (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))))) && ((float_Array_0[0] > double_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_short_int_Array_0[0]) > (-64)) ? (unsigned_short_int_Array_0[0]) : (-64))) + ((unsigned_short_int_Array_0[0] + -2) + unsigned_short_int_Array_0[1])))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] EXPR (((0.625f > last_1_double_Array_0_1_) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))))) : 1) : (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))))) && ((float_Array_0[0] > double_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_short_int_Array_0[0]) > (-64)) ? (unsigned_short_int_Array_0[0]) : (-64))) + ((unsigned_short_int_Array_0[0] + -2) + unsigned_short_int_Array_0[1])))) : 1)) && (BOOL_unsigned_char_Array_0[0] ? ((unsigned_short_int_Array_0[0] >= ((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) * 64)) ? (double_Array_0[1] == ((double) (((((double_Array_0[0]) < (50.5)) ? (double_Array_0[0]) : (50.5))) - double_Array_0[2]))) : 1) : ((float_Array_0[1] <= float_Array_0[1]) ? (double_Array_0[1] == ((double) (double_Array_0[2] - (double_Array_0[3] - double_Array_0[4])))) : 1)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] EXPR (((0.625f > last_1_double_Array_0_1_) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))))) : 1) : (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))))) && ((float_Array_0[0] > double_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_short_int_Array_0[0]) > (-64)) ? (unsigned_short_int_Array_0[0]) : (-64))) + ((unsigned_short_int_Array_0[0] + -2) + unsigned_short_int_Array_0[1])))) : 1)) && (BOOL_unsigned_char_Array_0[0] ? ((unsigned_short_int_Array_0[0] >= ((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) * 64)) ? (double_Array_0[1] == ((double) (((((double_Array_0[0]) < (50.5)) ? (double_Array_0[0]) : (50.5))) - double_Array_0[2]))) : 1) : ((float_Array_0[1] <= float_Array_0[1]) ? (double_Array_0[1] == ((double) (double_Array_0[2] - (double_Array_0[3] - double_Array_0[4])))) : 1)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] EXPR ((((0.625f > last_1_double_Array_0_1_) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))))) : 1) : (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))))) && ((float_Array_0[0] > double_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_short_int_Array_0[0]) > (-64)) ? (unsigned_short_int_Array_0[0]) : (-64))) + ((unsigned_short_int_Array_0[0] + -2) + unsigned_short_int_Array_0[1])))) : 1)) && (BOOL_unsigned_char_Array_0[0] ? ((unsigned_short_int_Array_0[0] >= ((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) * 64)) ? (double_Array_0[1] == ((double) (((((double_Array_0[0]) < (50.5)) ? (double_Array_0[0]) : (50.5))) - double_Array_0[2]))) : 1) : ((float_Array_0[1] <= float_Array_0[1]) ? (double_Array_0[1] == ((double) (double_Array_0[2] - (double_Array_0[3] - double_Array_0[4])))) : 1))) && (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] EXPR ((((0.625f > last_1_double_Array_0_1_) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))))) : 1) : (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))))) && ((float_Array_0[0] > double_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_short_int_Array_0[0]) > (-64)) ? (unsigned_short_int_Array_0[0]) : (-64))) + ((unsigned_short_int_Array_0[0] + -2) + unsigned_short_int_Array_0[1])))) : 1)) && (BOOL_unsigned_char_Array_0[0] ? ((unsigned_short_int_Array_0[0] >= ((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) * 64)) ? (double_Array_0[1] == ((double) (((((double_Array_0[0]) < (50.5)) ? (double_Array_0[0]) : (50.5))) - double_Array_0[2]))) : 1) : ((float_Array_0[1] <= float_Array_0[1]) ? (double_Array_0[1] == ((double) (double_Array_0[2] - (double_Array_0[3] - double_Array_0[4])))) : 1))) && (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] EXPR (((((0.625f > last_1_double_Array_0_1_) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))))) : 1) : (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))))) && ((float_Array_0[0] > double_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_short_int_Array_0[0]) > (-64)) ? (unsigned_short_int_Array_0[0]) : (-64))) + ((unsigned_short_int_Array_0[0] + -2) + unsigned_short_int_Array_0[1])))) : 1)) && (BOOL_unsigned_char_Array_0[0] ? ((unsigned_short_int_Array_0[0] >= ((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) * 64)) ? (double_Array_0[1] == ((double) (((((double_Array_0[0]) < (50.5)) ? (double_Array_0[0]) : (50.5))) - double_Array_0[2]))) : 1) : ((float_Array_0[1] <= float_Array_0[1]) ? (double_Array_0[1] == ((double) (double_Array_0[2] - (double_Array_0[3] - double_Array_0[4])))) : 1))) && (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1]))) && (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[2])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] EXPR (((((0.625f > last_1_double_Array_0_1_) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))))) : 1) : (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))))) && ((float_Array_0[0] > double_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_short_int_Array_0[0]) > (-64)) ? (unsigned_short_int_Array_0[0]) : (-64))) + ((unsigned_short_int_Array_0[0] + -2) + unsigned_short_int_Array_0[1])))) : 1)) && (BOOL_unsigned_char_Array_0[0] ? ((unsigned_short_int_Array_0[0] >= ((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) * 64)) ? (double_Array_0[1] == ((double) (((((double_Array_0[0]) < (50.5)) ? (double_Array_0[0]) : (50.5))) - double_Array_0[2]))) : 1) : ((float_Array_0[1] <= float_Array_0[1]) ? (double_Array_0[1] == ((double) (double_Array_0[2] - (double_Array_0[3] - double_Array_0[4])))) : 1))) && (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1]))) && (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[2])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] EXPR ((((((0.625f > last_1_double_Array_0_1_) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))))) : 1) : (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))))) && ((float_Array_0[0] > double_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_short_int_Array_0[0]) > (-64)) ? (unsigned_short_int_Array_0[0]) : (-64))) + ((unsigned_short_int_Array_0[0] + -2) + unsigned_short_int_Array_0[1])))) : 1)) && (BOOL_unsigned_char_Array_0[0] ? ((unsigned_short_int_Array_0[0] >= ((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) * 64)) ? (double_Array_0[1] == ((double) (((((double_Array_0[0]) < (50.5)) ? (double_Array_0[0]) : (50.5))) - double_Array_0[2]))) : 1) : ((float_Array_0[1] <= float_Array_0[1]) ? (double_Array_0[1] == ((double) (double_Array_0[2] - (double_Array_0[3] - double_Array_0[4])))) : 1))) && (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1]))) && (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[2]))) && (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_short_int_Array_0[2])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] EXPR ((((((0.625f > last_1_double_Array_0_1_) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))))) : 1) : (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))))) && ((float_Array_0[0] > double_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_short_int_Array_0[0]) > (-64)) ? (unsigned_short_int_Array_0[0]) : (-64))) + ((unsigned_short_int_Array_0[0] + -2) + unsigned_short_int_Array_0[1])))) : 1)) && (BOOL_unsigned_char_Array_0[0] ? ((unsigned_short_int_Array_0[0] >= ((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) * 64)) ? (double_Array_0[1] == ((double) (((((double_Array_0[0]) < (50.5)) ? (double_Array_0[0]) : (50.5))) - double_Array_0[2]))) : 1) : ((float_Array_0[1] <= float_Array_0[1]) ? (double_Array_0[1] == ((double) (double_Array_0[2] - (double_Array_0[3] - double_Array_0[4])))) : 1))) && (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1]))) && (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[2]))) && (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_short_int_Array_0[2])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92-L93] return ((((((0.625f > last_1_double_Array_0_1_) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]))))) : 1) : (float_Array_0[1] == ((float) ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))))) && ((float_Array_0[0] > double_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_short_int_Array_0[0]) > (-64)) ? (unsigned_short_int_Array_0[0]) : (-64))) + ((unsigned_short_int_Array_0[0] + -2) + unsigned_short_int_Array_0[1])))) : 1)) && (BOOL_unsigned_char_Array_0[0] ? ((unsigned_short_int_Array_0[0] >= ((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) * 64)) ? (double_Array_0[1] == ((double) (((((double_Array_0[0]) < (50.5)) ? (double_Array_0[0]) : (50.5))) - double_Array_0[2]))) : 1) : ((float_Array_0[1] <= float_Array_0[1]) ? (double_Array_0[1] == ((double) (double_Array_0[2] - (double_Array_0[3] - double_Array_0[4])))) : 1))) && (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1]))) && (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[2]))) && (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_short_int_Array_0[2])) ; [L102] RET, EXPR property() [L102] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_1_=201/2, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 107 locations, 170 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.3s, OverallIterations: 8, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 122 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 121 mSDsluCounter, 3071 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2020 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 135 IncrementalHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 1051 mSDtfsCounter, 135 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 581 GetRequests, 546 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=118occurred in iteration=7, InterpolantAutomatonStates: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 54 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1404 NumberOfCodeBlocks, 1404 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1284 ConstructedInterpolants, 0 QuantifiedInterpolants, 1380 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1998 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 12 InterpolantComputations, 7 PerfectInterpolantSequences, 2500/2640 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-17 05:26:31,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-65.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 1909061afd980a39396ef4a3c6a4eb0a48d7b8752c9988e586de4638f163afa1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:26:33,588 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:26:33,659 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 05:26:33,666 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:26:33,666 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:26:33,683 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:26:33,683 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:26:33,683 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:26:33,684 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:26:33,684 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:26:33,684 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:26:33,684 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:26:33,684 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:26:33,684 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:26:33,684 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:26:33,684 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:26:33,684 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:26:33,684 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:26:33,684 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:26:33,685 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:26:33,685 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:26:33,685 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:26:33,685 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:26:33,685 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 05:26:33,685 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 05:26:33,685 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 05:26:33,685 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:26:33,685 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:26:33,685 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:26:33,685 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:26:33,685 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:26:33,685 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:26:33,685 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:26:33,685 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:26:33,685 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:26:33,685 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:26:33,685 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:26:33,686 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:26:33,686 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:26:33,686 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 05:26:33,686 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 05:26:33,686 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:26:33,686 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:26:33,686 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:26:33,686 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:26:33,686 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 -> 1909061afd980a39396ef4a3c6a4eb0a48d7b8752c9988e586de4638f163afa1 [2025-03-17 05:26:33,924 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:26:33,932 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:26:33,934 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:26:33,936 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:26:33,936 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:26:33,937 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-65.i [2025-03-17 05:26:35,088 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0214b1d49/03ba14f3f6e94434ae3bd4dd372fba8e/FLAGbec44f4a2 [2025-03-17 05:26:35,283 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:26:35,284 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-65.i [2025-03-17 05:26:35,290 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0214b1d49/03ba14f3f6e94434ae3bd4dd372fba8e/FLAGbec44f4a2 [2025-03-17 05:26:35,304 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0214b1d49/03ba14f3f6e94434ae3bd4dd372fba8e [2025-03-17 05:26:35,306 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:26:35,309 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:26:35,310 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:26:35,311 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:26:35,314 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:26:35,315 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:26:35" (1/1) ... [2025-03-17 05:26:35,315 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@571db7c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:26:35, skipping insertion in model container [2025-03-17 05:26:35,315 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:26:35" (1/1) ... [2025-03-17 05:26:35,333 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:26:35,435 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-a_file-65.i[916,929] [2025-03-17 05:26:35,487 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:26:35,501 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:26:35,509 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-a_file-65.i[916,929] [2025-03-17 05:26:35,548 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:26:35,572 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:26:35,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:26:35 WrapperNode [2025-03-17 05:26:35,573 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:26:35,574 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:26:35,574 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:26:35,574 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:26:35,579 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:26:35" (1/1) ... [2025-03-17 05:26:35,597 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:26:35" (1/1) ... [2025-03-17 05:26:35,631 INFO L138 Inliner]: procedures = 39, calls = 151, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 486 [2025-03-17 05:26:35,631 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:26:35,632 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:26:35,632 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:26:35,632 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:26:35,641 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:26:35" (1/1) ... [2025-03-17 05:26:35,641 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:26:35" (1/1) ... [2025-03-17 05:26:35,646 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:26:35" (1/1) ... [2025-03-17 05:26:35,674 INFO L175 MemorySlicer]: Split 123 memory accesses to 7 slices as follows [2, 8, 44, 29, 9, 3, 28]. 36 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 5, 2, 2, 1, 3]. The 16 writes are split as follows [0, 1, 6, 3, 2, 1, 3]. [2025-03-17 05:26:35,675 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:26:35" (1/1) ... [2025-03-17 05:26:35,675 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:26:35" (1/1) ... [2025-03-17 05:26:35,706 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:26:35" (1/1) ... [2025-03-17 05:26:35,708 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:26:35" (1/1) ... [2025-03-17 05:26:35,714 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:26:35" (1/1) ... [2025-03-17 05:26:35,715 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:26:35" (1/1) ... [2025-03-17 05:26:35,721 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:26:35,722 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:26:35,722 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:26:35,722 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:26:35,723 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:26:35" (1/1) ... [2025-03-17 05:26:35,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:26:35,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:26:35,755 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-17 05:26:35,758 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-17 05:26:35,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:26:35,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-17 05:26:35,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-17 05:26:35,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-03-17 05:26:35,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-03-17 05:26:35,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2025-03-17 05:26:35,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2025-03-17 05:26:35,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2025-03-17 05:26:35,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-17 05:26:35,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-17 05:26:35,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-03-17 05:26:35,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-03-17 05:26:35,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2025-03-17 05:26:35,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2025-03-17 05:26:35,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2025-03-17 05:26:35,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-17 05:26:35,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-17 05:26:35,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-17 05:26:35,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-17 05:26:35,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-03-17 05:26:35,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-03-17 05:26:35,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2025-03-17 05:26:35,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-03-17 05:26:35,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-03-17 05:26:35,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-03-17 05:26:35,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-03-17 05:26:35,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-03-17 05:26:35,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-03-17 05:26:35,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2025-03-17 05:26:35,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 05:26:35,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-17 05:26:35,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-17 05:26:35,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-17 05:26:35,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-17 05:26:35,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-03-17 05:26:35,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2025-03-17 05:26:35,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-17 05:26:35,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-17 05:26:35,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-03-17 05:26:35,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-03-17 05:26:35,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-03-17 05:26:35,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-03-17 05:26:35,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2025-03-17 05:26:35,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-17 05:26:35,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-17 05:26:35,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-03-17 05:26:35,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-03-17 05:26:35,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-03-17 05:26:35,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2025-03-17 05:26:35,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2025-03-17 05:26:35,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-03-17 05:26:35,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-03-17 05:26:35,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-03-17 05:26:35,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-03-17 05:26:35,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2025-03-17 05:26:35,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2025-03-17 05:26:35,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2025-03-17 05:26:35,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-17 05:26:35,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-17 05:26:35,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-17 05:26:35,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-03-17 05:26:35,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-03-17 05:26:35,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-03-17 05:26:35,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2025-03-17 05:26:35,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-17 05:26:35,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-17 05:26:35,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-03-17 05:26:35,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-03-17 05:26:35,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-03-17 05:26:35,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2025-03-17 05:26:35,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2025-03-17 05:26:35,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-17 05:26:35,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-17 05:26:35,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-03-17 05:26:35,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-03-17 05:26:35,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-03-17 05:26:35,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2025-03-17 05:26:35,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2025-03-17 05:26:35,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-03-17 05:26:35,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-03-17 05:26:35,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-03-17 05:26:35,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-03-17 05:26:35,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-03-17 05:26:35,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2025-03-17 05:26:35,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2025-03-17 05:26:35,783 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:26:35,783 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:26:35,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:26:35,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:26:35,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-17 05:26:35,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-17 05:26:35,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-17 05:26:35,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-17 05:26:35,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-17 05:26:35,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-03-17 05:26:35,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2025-03-17 05:26:35,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-17 05:26:35,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-17 05:26:35,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-03-17 05:26:35,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-03-17 05:26:35,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-03-17 05:26:35,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2025-03-17 05:26:35,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2025-03-17 05:26:35,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-17 05:26:35,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-17 05:26:35,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-17 05:26:35,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-03-17 05:26:35,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-03-17 05:26:35,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-03-17 05:26:35,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2025-03-17 05:26:35,955 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:26:35,957 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:26:38,208 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L92: havoc property_#t~ite98#1;havoc property_#t~mem86#1;havoc property_#t~ite92#1;havoc property_#t~mem91#1;havoc property_#t~mem87#1;havoc property_#t~ite90#1;havoc property_#t~mem88#1;havoc property_#t~mem89#1;havoc property_#t~mem97#1;havoc property_#t~mem93#1;havoc property_#t~ite96#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~ite107#1;havoc property_#t~mem106#1;havoc property_#t~mem101#1;havoc property_#t~ite103#1;havoc property_#t~mem102#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~short108#1;havoc property_#t~mem109#1;havoc property_#t~ite126#1;havoc property_#t~mem112#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~ite118#1;havoc property_#t~mem117#1;havoc property_#t~mem113#1;havoc property_#t~ite115#1;havoc property_#t~mem114#1;havoc property_#t~mem116#1;havoc property_#t~mem119#1;havoc property_#t~mem120#1;havoc property_#t~ite125#1;havoc property_#t~mem124#1;havoc property_#t~mem123#1;havoc property_#t~mem121#1;havoc property_#t~mem122#1;havoc property_#t~short127#1;havoc property_#t~mem129#1;havoc property_#t~mem128#1;havoc property_#t~short130#1;havoc property_#t~mem132#1;havoc property_#t~mem131#1;havoc property_#t~short133#1;havoc property_#t~mem135#1;havoc property_#t~mem134#1;havoc property_#t~short136#1; [2025-03-17 05:26:38,234 INFO L? ?]: Removed 118 outVars from TransFormulas that were not future-live. [2025-03-17 05:26:38,234 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:26:38,241 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:26:38,241 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:26:38,241 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:26:38 BoogieIcfgContainer [2025-03-17 05:26:38,241 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:26:38,243 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:26:38,243 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:26:38,246 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:26:38,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:26:35" (1/3) ... [2025-03-17 05:26:38,246 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f5b208c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:26:38, skipping insertion in model container [2025-03-17 05:26:38,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:26:35" (2/3) ... [2025-03-17 05:26:38,246 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f5b208c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:26:38, skipping insertion in model container [2025-03-17 05:26:38,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:26:38" (3/3) ... [2025-03-17 05:26:38,247 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-65.i [2025-03-17 05:26:38,256 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:26:38,257 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-65.i that has 2 procedures, 107 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:26:38,287 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:26:38,294 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;@52cf287f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:26:38,295 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:26:38,298 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 93 states have (on average 1.4731182795698925) internal successors, (137), 94 states have internal predecessors, (137), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 05:26:38,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-17 05:26:38,306 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:26:38,307 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:26:38,307 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:26:38,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:26:38,311 INFO L85 PathProgramCache]: Analyzing trace with hash 757387111, now seen corresponding path program 1 times [2025-03-17 05:26:38,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:26:38,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [547941209] [2025-03-17 05:26:38,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:26:38,322 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-17 05:26:38,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:26:38,326 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-17 05:26:38,328 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-17 05:26:38,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-17 05:26:38,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-17 05:26:38,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:26:38,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:26:38,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:26:38,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:26:38,667 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-17 05:26:38,668 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:26:38,668 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:26:38,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [547941209] [2025-03-17 05:26:38,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [547941209] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:26:38,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:26:38,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 05:26:38,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131754501] [2025-03-17 05:26:38,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:26:38,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:26:38,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:26:38,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:26:38,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:26:38,706 INFO L87 Difference]: Start difference. First operand has 107 states, 93 states have (on average 1.4731182795698925) internal successors, (137), 94 states have internal predecessors, (137), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 05:26:38,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:26:38,730 INFO L93 Difference]: Finished difference Result 211 states and 327 transitions. [2025-03-17 05:26:38,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:26:38,733 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, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 108 [2025-03-17 05:26:38,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:26:38,737 INFO L225 Difference]: With dead ends: 211 [2025-03-17 05:26:38,737 INFO L226 Difference]: Without dead ends: 105 [2025-03-17 05:26:38,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 107 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-17 05:26:38,741 INFO L435 NwaCegarLoop]: 153 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, 153 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-17 05:26:38,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:26:38,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-17 05:26:38,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2025-03-17 05:26:38,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 92 states have (on average 1.423913043478261) internal successors, (131), 92 states have internal predecessors, (131), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 05:26:38,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 153 transitions. [2025-03-17 05:26:38,770 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 153 transitions. Word has length 108 [2025-03-17 05:26:38,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:26:38,770 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 153 transitions. [2025-03-17 05:26:38,770 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, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 05:26:38,770 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 153 transitions. [2025-03-17 05:26:38,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-17 05:26:38,776 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:26:38,776 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:26:38,785 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 (2)] Forceful destruction successful, exit code 0 [2025-03-17 05:26:38,977 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-17 05:26:38,977 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:26:38,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:26:38,978 INFO L85 PathProgramCache]: Analyzing trace with hash 2073987370, now seen corresponding path program 1 times [2025-03-17 05:26:38,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:26:38,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1103046002] [2025-03-17 05:26:38,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:26:38,978 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-17 05:26:38,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:26:38,980 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-17 05:26:38,981 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-17 05:26:39,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-17 05:26:39,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-17 05:26:39,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:26:39,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:26:39,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:26:39,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:26:39,309 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-17 05:26:39,309 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:26:39,309 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:26:39,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1103046002] [2025-03-17 05:26:39,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1103046002] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:26:39,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:26:39,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:26:39,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072107973] [2025-03-17 05:26:39,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:26:39,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:26:39,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:26:39,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:26:39,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:26:39,314 INFO L87 Difference]: Start difference. First operand 105 states and 153 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 05:26:39,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:26:39,380 INFO L93 Difference]: Finished difference Result 211 states and 308 transitions. [2025-03-17 05:26:39,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:26:39,381 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 108 [2025-03-17 05:26:39,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:26:39,381 INFO L225 Difference]: With dead ends: 211 [2025-03-17 05:26:39,381 INFO L226 Difference]: Without dead ends: 107 [2025-03-17 05:26:39,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:26:39,382 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:26:39,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 442 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:26:39,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-17 05:26:39,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2025-03-17 05:26:39,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 94 states have internal predecessors, (133), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 05:26:39,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 155 transitions. [2025-03-17 05:26:39,389 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 155 transitions. Word has length 108 [2025-03-17 05:26:39,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:26:39,390 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 155 transitions. [2025-03-17 05:26:39,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 05:26:39,390 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 155 transitions. [2025-03-17 05:26:39,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-17 05:26:39,391 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:26:39,391 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:26:39,404 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 (3)] Forceful destruction successful, exit code 0 [2025-03-17 05:26:39,598 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-17 05:26:39,598 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:26:39,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:26:39,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1612903063, now seen corresponding path program 1 times [2025-03-17 05:26:39,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:26:39,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [646362915] [2025-03-17 05:26:39,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:26:39,599 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-17 05:26:39,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:26:39,601 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-17 05:26:39,602 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-17 05:26:39,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-17 05:26:39,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-17 05:26:39,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:26:39,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:26:39,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:26:39,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:26:40,001 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:26:40,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 20 [2025-03-17 05:26:40,887 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 05:26:40,889 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:26:40,889 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:26:40,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [646362915] [2025-03-17 05:26:40,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [646362915] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:26:40,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:26:40,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 05:26:40,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962883622] [2025-03-17 05:26:40,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:26:40,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:26:40,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:26:40,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:26:40,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:26:40,892 INFO L87 Difference]: Start difference. First operand 107 states and 155 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:26:44,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 05:26:45,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 05:26:47,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:26:47,066 INFO L93 Difference]: Finished difference Result 349 states and 502 transitions. [2025-03-17 05:26:47,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:26:47,073 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 108 [2025-03-17 05:26:47,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:26:47,075 INFO L225 Difference]: With dead ends: 349 [2025-03-17 05:26:47,075 INFO L226 Difference]: Without dead ends: 243 [2025-03-17 05:26:47,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:26:47,076 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 237 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:26:47,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 320 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2025-03-17 05:26:47,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-03-17 05:26:47,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 210. [2025-03-17 05:26:47,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 185 states have (on average 1.3945945945945946) internal successors, (258), 185 states have internal predecessors, (258), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 05:26:47,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 302 transitions. [2025-03-17 05:26:47,093 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 302 transitions. Word has length 108 [2025-03-17 05:26:47,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:26:47,093 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 302 transitions. [2025-03-17 05:26:47,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:26:47,093 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 302 transitions. [2025-03-17 05:26:47,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-17 05:26:47,094 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:26:47,094 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:26:47,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2025-03-17 05:26:47,301 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-17 05:26:47,301 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:26:47,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:26:47,302 INFO L85 PathProgramCache]: Analyzing trace with hash -88349551, now seen corresponding path program 1 times [2025-03-17 05:26:47,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:26:47,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [309490121] [2025-03-17 05:26:47,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:26:47,302 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-17 05:26:47,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:26:47,305 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-17 05:26:47,306 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-17 05:26:47,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-17 05:26:47,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-17 05:26:47,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:26:47,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:26:47,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:26:47,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:26:47,620 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 05:26:47,620 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:26:47,620 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:26:47,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [309490121] [2025-03-17 05:26:47,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [309490121] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:26:47,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:26:47,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:26:47,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395733990] [2025-03-17 05:26:47,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:26:47,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:26:47,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:26:47,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:26:47,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:26:47,622 INFO L87 Difference]: Start difference. First operand 210 states and 302 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:26:47,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:26:47,670 INFO L93 Difference]: Finished difference Result 429 states and 617 transitions. [2025-03-17 05:26:47,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:26:47,671 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 109 [2025-03-17 05:26:47,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:26:47,672 INFO L225 Difference]: With dead ends: 429 [2025-03-17 05:26:47,672 INFO L226 Difference]: Without dead ends: 220 [2025-03-17 05:26:47,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:26:47,674 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 1 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:26:47,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 576 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:26:47,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-03-17 05:26:47,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 218. [2025-03-17 05:26:47,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 193 states have (on average 1.378238341968912) internal successors, (266), 193 states have internal predecessors, (266), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 05:26:47,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 310 transitions. [2025-03-17 05:26:47,688 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 310 transitions. Word has length 109 [2025-03-17 05:26:47,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:26:47,689 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 310 transitions. [2025-03-17 05:26:47,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:26:47,689 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 310 transitions. [2025-03-17 05:26:47,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-17 05:26:47,690 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:26:47,690 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:26:47,702 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-17 05:26:47,891 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-17 05:26:47,892 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:26:47,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:26:47,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1895804014, now seen corresponding path program 1 times [2025-03-17 05:26:47,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:26:47,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [574928154] [2025-03-17 05:26:47,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:26:47,893 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-17 05:26:47,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:26:47,895 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-17 05:26:47,895 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-17 05:26:48,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-17 05:26:48,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-17 05:26:48,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:26:48,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:26:48,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 05:26:48,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:26:48,238 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 05:26:48,239 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:26:48,239 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:26:48,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [574928154] [2025-03-17 05:26:48,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [574928154] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:26:48,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:26:48,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:26:48,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372274680] [2025-03-17 05:26:48,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:26:48,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:26:48,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:26:48,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:26:48,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:26:48,240 INFO L87 Difference]: Start difference. First operand 218 states and 310 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:26:48,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:26:48,298 INFO L93 Difference]: Finished difference Result 441 states and 627 transitions. [2025-03-17 05:26:48,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:26:48,298 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 109 [2025-03-17 05:26:48,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:26:48,299 INFO L225 Difference]: With dead ends: 441 [2025-03-17 05:26:48,299 INFO L226 Difference]: Without dead ends: 224 [2025-03-17 05:26:48,300 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:26:48,300 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 1 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:26:48,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 710 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:26:48,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-03-17 05:26:48,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 222. [2025-03-17 05:26:48,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 197 states have (on average 1.3705583756345177) internal successors, (270), 197 states have internal predecessors, (270), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 05:26:48,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 314 transitions. [2025-03-17 05:26:48,309 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 314 transitions. Word has length 109 [2025-03-17 05:26:48,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:26:48,310 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 314 transitions. [2025-03-17 05:26:48,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:26:48,310 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 314 transitions. [2025-03-17 05:26:48,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-17 05:26:48,311 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:26:48,311 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:26:48,320 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-17 05:26:48,511 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-17 05:26:48,511 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:26:48,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:26:48,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1008300333, now seen corresponding path program 1 times [2025-03-17 05:26:48,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:26:48,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1770507068] [2025-03-17 05:26:48,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:26:48,512 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:26:48,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:26:48,514 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-17 05:26:48,515 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-17 05:26:48,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-17 05:26:48,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-17 05:26:48,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:26:48,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:26:48,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 05:26:48,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:26:48,832 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 05:26:48,832 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:26:48,832 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:26:48,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1770507068] [2025-03-17 05:26:48,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1770507068] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:26:48,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:26:48,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:26:48,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055416223] [2025-03-17 05:26:48,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:26:48,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:26:48,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:26:48,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:26:48,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:26:48,834 INFO L87 Difference]: Start difference. First operand 222 states and 314 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:26:48,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:26:48,891 INFO L93 Difference]: Finished difference Result 449 states and 635 transitions. [2025-03-17 05:26:48,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:26:48,891 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 109 [2025-03-17 05:26:48,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:26:48,894 INFO L225 Difference]: With dead ends: 449 [2025-03-17 05:26:48,894 INFO L226 Difference]: Without dead ends: 228 [2025-03-17 05:26:48,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:26:48,896 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 1 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:26:48,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 845 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:26:48,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-03-17 05:26:48,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 226. [2025-03-17 05:26:48,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 201 states have (on average 1.36318407960199) internal successors, (274), 201 states have internal predecessors, (274), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 05:26:48,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 318 transitions. [2025-03-17 05:26:48,909 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 318 transitions. Word has length 109 [2025-03-17 05:26:48,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:26:48,910 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 318 transitions. [2025-03-17 05:26:48,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:26:48,910 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 318 transitions. [2025-03-17 05:26:48,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-17 05:26:48,911 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:26:48,912 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:26:48,921 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-17 05:26:49,112 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-17 05:26:49,112 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:26:49,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:26:49,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1007376812, now seen corresponding path program 1 times [2025-03-17 05:26:49,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:26:49,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1750595436] [2025-03-17 05:26:49,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:26:49,114 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-17 05:26:49,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:26:49,115 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-17 05:26:49,117 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-17 05:26:49,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-17 05:26:49,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-17 05:26:49,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:26:49,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:26:49,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 05:26:49,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:26:49,475 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:26:49,475 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-17 05:26:49,503 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-03-17 05:26:49,504 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:26:49,504 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:26:49,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1750595436] [2025-03-17 05:26:49,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1750595436] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:26:49,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:26:49,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:26:49,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438351934] [2025-03-17 05:26:49,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:26:49,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:26:49,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:26:49,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:26:49,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:26:49,505 INFO L87 Difference]: Start difference. First operand 226 states and 318 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 05:26:52,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:26:52,479 INFO L93 Difference]: Finished difference Result 453 states and 637 transitions. [2025-03-17 05:26:52,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:26:52,480 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 109 [2025-03-17 05:26:52,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:26:52,481 INFO L225 Difference]: With dead ends: 453 [2025-03-17 05:26:52,481 INFO L226 Difference]: Without dead ends: 228 [2025-03-17 05:26:52,482 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 104 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-17 05:26:52,483 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 141 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-17 05:26:52,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 390 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-17 05:26:52,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-03-17 05:26:52,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 226. [2025-03-17 05:26:52,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 201 states have (on average 1.3532338308457712) internal successors, (272), 201 states have internal predecessors, (272), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 05:26:52,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 316 transitions. [2025-03-17 05:26:52,494 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 316 transitions. Word has length 109 [2025-03-17 05:26:52,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:26:52,494 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 316 transitions. [2025-03-17 05:26:52,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 05:26:52,495 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 316 transitions. [2025-03-17 05:26:52,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-17 05:26:52,495 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:26:52,495 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:26:52,506 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-17 05:26:52,696 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-17 05:26:52,696 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:26:52,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:26:52,697 INFO L85 PathProgramCache]: Analyzing trace with hash 399937554, now seen corresponding path program 1 times [2025-03-17 05:26:52,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:26:52,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1585365639] [2025-03-17 05:26:52,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:26:52,697 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-17 05:26:52,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:26:52,699 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-17 05:26:52,701 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-17 05:26:52,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-17 05:26:52,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-17 05:26:52,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:26:52,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:26:53,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 05:26:53,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:26:53,202 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:26:53,203 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-17 05:26:53,226 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-17 05:26:53,226 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:26:53,226 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:26:53,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1585365639] [2025-03-17 05:26:53,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1585365639] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:26:53,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:26:53,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:26:53,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376440201] [2025-03-17 05:26:53,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:26:53,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:26:53,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:26:53,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:26:53,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:26:53,227 INFO L87 Difference]: Start difference. First operand 226 states and 316 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 05:26:55,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:26:57,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:26:57,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:26:57,502 INFO L93 Difference]: Finished difference Result 453 states and 633 transitions. [2025-03-17 05:26:57,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:26:57,503 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 111 [2025-03-17 05:26:57,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:26:57,504 INFO L225 Difference]: With dead ends: 453 [2025-03-17 05:26:57,504 INFO L226 Difference]: Without dead ends: 228 [2025-03-17 05:26:57,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 106 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-17 05:26:57,504 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 133 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:26:57,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 386 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-03-17 05:26:57,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-03-17 05:26:57,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 226. [2025-03-17 05:26:57,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 201 states have (on average 1.3432835820895523) internal successors, (270), 201 states have internal predecessors, (270), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 05:26:57,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 314 transitions. [2025-03-17 05:26:57,512 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 314 transitions. Word has length 111 [2025-03-17 05:26:57,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:26:57,512 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 314 transitions. [2025-03-17 05:26:57,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 05:26:57,512 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 314 transitions. [2025-03-17 05:26:57,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-17 05:26:57,513 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:26:57,513 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:26:57,527 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 (9)] Ended with exit code 0 [2025-03-17 05:26:57,713 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-17 05:26:57,714 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:26:57,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:26:57,714 INFO L85 PathProgramCache]: Analyzing trace with hash 656613076, now seen corresponding path program 1 times [2025-03-17 05:26:57,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:26:57,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2043771892] [2025-03-17 05:26:57,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:26:57,715 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-17 05:26:57,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:26:57,717 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-17 05:26:57,718 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-17 05:26:57,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-17 05:26:58,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-17 05:26:58,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:26:58,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:26:58,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 05:26:58,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:26:58,208 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:26:58,208 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 175 treesize of output 67 [2025-03-17 05:26:58,230 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-03-17 05:26:58,230 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:26:58,230 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:26:58,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2043771892] [2025-03-17 05:26:58,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2043771892] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:26:58,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:26:58,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:26:58,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453884928] [2025-03-17 05:26:58,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:26:58,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:26:58,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:26:58,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:26:58,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:26:58,231 INFO L87 Difference]: Start difference. First operand 226 states and 314 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 05:26:59,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:27:01,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:27:01,805 INFO L93 Difference]: Finished difference Result 453 states and 629 transitions. [2025-03-17 05:27:01,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:27:01,806 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 113 [2025-03-17 05:27:01,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:27:01,807 INFO L225 Difference]: With dead ends: 453 [2025-03-17 05:27:01,807 INFO L226 Difference]: Without dead ends: 228 [2025-03-17 05:27:01,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 108 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-17 05:27:01,808 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 123 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:27:01,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 382 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-03-17 05:27:01,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-03-17 05:27:01,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 226. [2025-03-17 05:27:01,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 201 states have (on average 1.3333333333333333) internal successors, (268), 201 states have internal predecessors, (268), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 05:27:01,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 312 transitions. [2025-03-17 05:27:01,818 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 312 transitions. Word has length 113 [2025-03-17 05:27:01,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:27:01,818 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 312 transitions. [2025-03-17 05:27:01,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 05:27:01,818 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 312 transitions. [2025-03-17 05:27:01,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-17 05:27:01,819 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:27:01,819 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:27:01,831 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-17 05:27:02,019 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-17 05:27:02,020 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:27:02,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:27:02,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1817503086, now seen corresponding path program 1 times [2025-03-17 05:27:02,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:27:02,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [816793587] [2025-03-17 05:27:02,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:27:02,020 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-17 05:27:02,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:27:02,023 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-17 05:27:02,029 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-17 05:27:02,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 05:27:02,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 05:27:02,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:27:02,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:27:02,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 05:27:02,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:27:02,504 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:27:02,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2025-03-17 05:27:02,530 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-17 05:27:02,530 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:27:02,530 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:27:02,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [816793587] [2025-03-17 05:27:02,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [816793587] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:27:02,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:27:02,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:27:02,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022526849] [2025-03-17 05:27:02,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:27:02,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:27:02,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:27:02,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:27:02,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:27:02,531 INFO L87 Difference]: Start difference. First operand 226 states and 312 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 05:27:04,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:27:06,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:27:07,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:27:07,223 INFO L93 Difference]: Finished difference Result 451 states and 623 transitions. [2025-03-17 05:27:07,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:27:07,224 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 115 [2025-03-17 05:27:07,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:27:07,225 INFO L225 Difference]: With dead ends: 451 [2025-03-17 05:27:07,225 INFO L226 Difference]: Without dead ends: 226 [2025-03-17 05:27:07,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:27:07,226 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 116 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-03-17 05:27:07,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 378 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-03-17 05:27:07,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2025-03-17 05:27:07,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 222. [2025-03-17 05:27:07,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 197 states have (on average 1.3299492385786802) internal successors, (262), 197 states have internal predecessors, (262), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 05:27:07,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 306 transitions. [2025-03-17 05:27:07,234 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 306 transitions. Word has length 115 [2025-03-17 05:27:07,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:27:07,235 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 306 transitions. [2025-03-17 05:27:07,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 05:27:07,235 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 306 transitions. [2025-03-17 05:27:07,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-17 05:27:07,235 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:27:07,236 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:27:07,248 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 (11)] Ended with exit code 0 [2025-03-17 05:27:07,436 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-17 05:27:07,437 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:27:07,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:27:07,437 INFO L85 PathProgramCache]: Analyzing trace with hash 798074867, now seen corresponding path program 1 times [2025-03-17 05:27:07,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:27:07,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1794557912] [2025-03-17 05:27:07,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:27:07,438 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-17 05:27:07,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:27:07,440 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-17 05:27:07,441 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-17 05:27:07,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-17 05:27:07,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-17 05:27:07,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:27:07,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:27:07,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 05:27:07,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:27:07,958 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:27:07,958 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 172 treesize of output 64 [2025-03-17 05:27:08,018 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 120 proven. 20 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-03-17 05:27:08,018 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:27:08,268 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:27:08,270 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 110 treesize of output 1 [2025-03-17 05:27:08,290 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-17 05:27:08,291 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:27:08,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1794557912] [2025-03-17 05:27:08,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1794557912] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:27:08,291 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:27:08,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2025-03-17 05:27:08,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727280415] [2025-03-17 05:27:08,291 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 05:27:08,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 05:27:08,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:27:08,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 05:27:08,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:27:08,292 INFO L87 Difference]: Start difference. First operand 222 states and 306 transitions. Second operand has 12 states, 11 states have (on average 9.272727272727273) internal successors, (102), 12 states have internal predecessors, (102), 4 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2025-03-17 05:27:10,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:27:12,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:27:12,929 INFO L93 Difference]: Finished difference Result 469 states and 641 transitions. [2025-03-17 05:27:12,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 05:27:12,930 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 9.272727272727273) internal successors, (102), 12 states have internal predecessors, (102), 4 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) Word has length 117 [2025-03-17 05:27:12,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:27:12,932 INFO L225 Difference]: With dead ends: 469 [2025-03-17 05:27:12,932 INFO L226 Difference]: Without dead ends: 226 [2025-03-17 05:27:12,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2025-03-17 05:27:12,933 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 130 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:27:12,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 492 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-03-17 05:27:12,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2025-03-17 05:27:12,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 222. [2025-03-17 05:27:12,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 197 states have (on average 1.3096446700507614) internal successors, (258), 197 states have internal predecessors, (258), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 05:27:12,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 302 transitions. [2025-03-17 05:27:12,940 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 302 transitions. Word has length 117 [2025-03-17 05:27:12,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:27:12,940 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 302 transitions. [2025-03-17 05:27:12,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 9.272727272727273) internal successors, (102), 12 states have internal predecessors, (102), 4 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2025-03-17 05:27:12,941 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 302 transitions. [2025-03-17 05:27:12,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-17 05:27:12,941 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:27:12,941 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:27:12,953 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 (12)] Ended with exit code 0 [2025-03-17 05:27:13,142 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-17 05:27:13,142 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:27:13,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:27:13,143 INFO L85 PathProgramCache]: Analyzing trace with hash -156154028, now seen corresponding path program 1 times [2025-03-17 05:27:13,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:27:13,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1158900404] [2025-03-17 05:27:13,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:27:13,143 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-17 05:27:13,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:27:13,145 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-17 05:27:13,146 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-17 05:27:13,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-17 05:27:13,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-17 05:27:13,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:27:13,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:27:13,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 05:27:13,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:27:13,651 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 8 treesize of output 1 [2025-03-17 05:27:14,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 65 [2025-03-17 05:27:14,408 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:27:14,409 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 143 treesize of output 59 [2025-03-17 05:27:27,981 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-17 05:27:27,981 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:27:27,981 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:27:27,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1158900404] [2025-03-17 05:27:27,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1158900404] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:27:27,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:27:27,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 05:27:27,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126663163] [2025-03-17 05:27:27,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:27:27,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 05:27:27,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:27:27,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 05:27:27,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=97, Unknown=3, NotChecked=0, Total=132 [2025-03-17 05:27:27,982 INFO L87 Difference]: Start difference. First operand 222 states and 302 transitions. Second operand has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 05:27:33,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 05:27:37,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 05:27:42,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 05:27:47,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 05:27:51,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 05:27:56,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 05:28:01,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 05:28:07,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.46s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]