./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-14.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-14.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 fa1f0900915e9d0a4bf98ef205532704c7807bfe3d7587fb7faefc96b22ae06b --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:20:08,925 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:20:08,986 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:20:08,990 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:20:08,990 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:20:09,006 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:20:09,007 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:20:09,007 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:20:09,007 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:20:09,008 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:20:09,008 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:20:09,008 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:20:09,009 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:20:09,009 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:20:09,009 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:20:09,009 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:20:09,009 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:20:09,010 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:20:09,010 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:20:09,010 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:20:09,010 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:20:09,010 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:20:09,010 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:20:09,010 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:20:09,010 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:20:09,010 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:20:09,010 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:20:09,010 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:20:09,010 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:20:09,011 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:20:09,011 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:20:09,011 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:20:09,011 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:20:09,011 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:20:09,011 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:20:09,011 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:20:09,012 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:20:09,012 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:20:09,012 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:20:09,012 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:20:09,012 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:20:09,012 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:20:09,012 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:20:09,012 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 -> fa1f0900915e9d0a4bf98ef205532704c7807bfe3d7587fb7faefc96b22ae06b [2025-03-17 05:20:09,224 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:20:09,233 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:20:09,234 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:20:09,235 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:20:09,235 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:20:09,235 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-14.i [2025-03-17 05:20:10,371 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d8cd2c95/825ba6ee339743258b6ae4376445604d/FLAGbc944958f [2025-03-17 05:20:10,660 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:20:10,660 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-14.i [2025-03-17 05:20:10,675 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d8cd2c95/825ba6ee339743258b6ae4376445604d/FLAGbc944958f [2025-03-17 05:20:10,687 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d8cd2c95/825ba6ee339743258b6ae4376445604d [2025-03-17 05:20:10,689 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:20:10,691 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:20:10,692 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:20:10,692 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:20:10,695 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:20:10,696 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:20:10" (1/1) ... [2025-03-17 05:20:10,696 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a2d8c84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:20:10, skipping insertion in model container [2025-03-17 05:20:10,697 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:20:10" (1/1) ... [2025-03-17 05:20:10,710 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:20:10,815 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-14.i[916,929] [2025-03-17 05:20:10,862 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:20:10,874 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:20:10,882 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-14.i[916,929] [2025-03-17 05:20:10,913 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:20:10,928 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:20:10,929 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:20:10 WrapperNode [2025-03-17 05:20:10,929 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:20:10,930 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:20:10,930 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:20:10,930 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:20:10,934 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:20:10" (1/1) ... [2025-03-17 05:20:10,942 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:20:10" (1/1) ... [2025-03-17 05:20:10,975 INFO L138 Inliner]: procedures = 29, calls = 188, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 566 [2025-03-17 05:20:10,975 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:20:10,976 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:20:10,976 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:20:10,976 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:20:10,982 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:20:10" (1/1) ... [2025-03-17 05:20:10,982 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:20:10" (1/1) ... [2025-03-17 05:20:10,989 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:20:10" (1/1) ... [2025-03-17 05:20:11,004 INFO L175 MemorySlicer]: Split 150 memory accesses to 7 slices as follows [2, 36, 8, 27, 3, 47, 27]. 31 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 5, 1, 3, 1, 4, 2]. The 20 writes are split as follows [0, 6, 1, 3, 1, 5, 4]. [2025-03-17 05:20:11,005 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:20:10" (1/1) ... [2025-03-17 05:20:11,005 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:20:10" (1/1) ... [2025-03-17 05:20:11,027 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:20:10" (1/1) ... [2025-03-17 05:20:11,028 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:20:10" (1/1) ... [2025-03-17 05:20:11,036 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:20:10" (1/1) ... [2025-03-17 05:20:11,037 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:20:10" (1/1) ... [2025-03-17 05:20:11,044 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:20:11,044 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:20:11,044 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:20:11,044 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:20:11,045 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:20:10" (1/1) ... [2025-03-17 05:20:11,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:20:11,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:20:11,071 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:20:11,073 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:20:11,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:20:11,090 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-17 05:20:11,090 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-17 05:20:11,090 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-17 05:20:11,090 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-17 05:20:11,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-17 05:20:11,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-03-17 05:20:11,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-03-17 05:20:11,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 05:20:11,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 05:20:11,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 05:20:11,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 05:20:11,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 05:20:11,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-17 05:20:11,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-17 05:20:11,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-17 05:20:11,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-17 05:20:11,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-17 05:20:11,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-17 05:20:11,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-17 05:20:11,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-03-17 05:20:11,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2025-03-17 05:20:11,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 05:20:11,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 05:20:11,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 05:20:11,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 05:20:11,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 05:20:11,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-17 05:20:11,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-17 05:20:11,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-17 05:20:11,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-17 05:20:11,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-17 05:20:11,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-17 05:20:11,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-17 05:20:11,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-03-17 05:20:11,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2025-03-17 05:20:11,093 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:20:11,093 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:20:11,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 05:20:11,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 05:20:11,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 05:20:11,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 05:20:11,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 05:20:11,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-17 05:20:11,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-17 05:20:11,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:20:11,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:20:11,215 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:20:11,217 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:20:11,566 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L107: havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~short106#1;havoc property_#t~ite109#1;havoc property_#t~mem108#1;havoc property_#t~mem107#1;havoc property_#t~ite115#1;havoc property_#t~mem111#1;havoc property_#t~mem110#1;havoc property_#t~mem114#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~short116#1;havoc property_#t~mem117#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~short120#1;havoc property_#t~mem121#1;havoc property_#t~short122#1;havoc property_#t~ite129#1;havoc property_#t~mem124#1;havoc property_#t~mem123#1;havoc property_#t~mem128#1;havoc property_#t~mem125#1;havoc property_#t~mem126#1;havoc property_#t~short127#1;havoc property_#t~short130#1;havoc property_#t~mem131#1;havoc property_#t~mem132#1;havoc property_#t~mem133#1;havoc property_#t~ite160#1;havoc property_#t~mem134#1;havoc property_#t~mem135#1;havoc property_#t~ite157#1;havoc property_#t~mem138#1;havoc property_#t~mem136#1;havoc property_#t~mem137#1;havoc property_#t~mem156#1;havoc property_#t~mem146#1;havoc property_#t~mem139#1;havoc property_#t~mem140#1;havoc property_#t~ite145#1;havoc property_#t~mem141#1;havoc property_#t~mem142#1;havoc property_#t~mem143#1;havoc property_#t~mem144#1;havoc property_#t~ite155#1;havoc property_#t~mem147#1;havoc property_#t~mem148#1;havoc property_#t~mem149#1;havoc property_#t~ite154#1;havoc property_#t~mem150#1;havoc property_#t~mem151#1;havoc property_#t~mem152#1;havoc property_#t~mem153#1;havoc property_#t~mem159#1;havoc property_#t~mem158#1;havoc property_#t~short161#1; [2025-03-17 05:20:11,608 INFO L? ?]: Removed 139 outVars from TransFormulas that were not future-live. [2025-03-17 05:20:11,608 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:20:11,619 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:20:11,620 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:20:11,620 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:20:11 BoogieIcfgContainer [2025-03-17 05:20:11,620 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:20:11,621 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:20:11,622 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:20:11,625 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:20:11,625 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:20:10" (1/3) ... [2025-03-17 05:20:11,626 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a005184 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:20:11, skipping insertion in model container [2025-03-17 05:20:11,626 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:20:10" (2/3) ... [2025-03-17 05:20:11,626 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a005184 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:20:11, skipping insertion in model container [2025-03-17 05:20:11,626 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:20:11" (3/3) ... [2025-03-17 05:20:11,627 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-14.i [2025-03-17 05:20:11,637 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:20:11,639 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-14.i that has 2 procedures, 122 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:20:11,683 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:20:11,692 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;@3b470150, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:20:11,693 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:20:11,696 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 98 states have (on average 1.4387755102040816) internal successors, (141), 99 states have internal predecessors, (141), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 05:20:11,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-17 05:20:11,706 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:11,707 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:11,707 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:11,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:11,712 INFO L85 PathProgramCache]: Analyzing trace with hash -557544856, now seen corresponding path program 1 times [2025-03-17 05:20:11,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:20:11,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592141496] [2025-03-17 05:20:11,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:11,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:20:11,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-17 05:20:11,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-17 05:20:11,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:11,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:12,044 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-03-17 05:20:12,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:20:12,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592141496] [2025-03-17 05:20:12,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592141496] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:20:12,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729388013] [2025-03-17 05:20:12,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:12,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:20:12,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:20:12,054 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:20:12,055 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:20:12,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-17 05:20:12,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-17 05:20:12,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:12,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:12,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:20:12,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:20:12,290 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-03-17 05:20:12,291 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:20:12,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [729388013] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:20:12,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:20:12,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:20:12,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214504275] [2025-03-17 05:20:12,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:20:12,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:20:12,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:20:12,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:20:12,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:20:12,312 INFO L87 Difference]: Start difference. First operand has 122 states, 98 states have (on average 1.4387755102040816) internal successors, (141), 99 states have internal predecessors, (141), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-17 05:20:12,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:12,332 INFO L93 Difference]: Finished difference Result 241 states and 385 transitions. [2025-03-17 05:20:12,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:20:12,334 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 164 [2025-03-17 05:20:12,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:12,338 INFO L225 Difference]: With dead ends: 241 [2025-03-17 05:20:12,338 INFO L226 Difference]: Without dead ends: 120 [2025-03-17 05:20:12,340 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 165 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:20:12,341 INFO L435 NwaCegarLoop]: 179 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, 179 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:20:12,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:20:12,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-17 05:20:12,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2025-03-17 05:20:12,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 97 states have (on average 1.4123711340206186) internal successors, (137), 97 states have internal predecessors, (137), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 05:20:12,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 179 transitions. [2025-03-17 05:20:12,371 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 179 transitions. Word has length 164 [2025-03-17 05:20:12,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:12,371 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 179 transitions. [2025-03-17 05:20:12,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-17 05:20:12,372 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 179 transitions. [2025-03-17 05:20:12,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-17 05:20:12,377 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:12,377 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:12,386 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:20:12,578 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:20:12,578 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:12,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:12,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1386601767, now seen corresponding path program 1 times [2025-03-17 05:20:12,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:20:12,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496547350] [2025-03-17 05:20:12,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:12,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:20:12,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-17 05:20:12,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-17 05:20:12,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:12,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:12,947 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-17 05:20:12,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:20:12,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496547350] [2025-03-17 05:20:12,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496547350] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:20:12,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:20:12,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:20:12,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888362418] [2025-03-17 05:20:12,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:20:12,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:20:12,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:20:12,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:20:12,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:20:12,950 INFO L87 Difference]: Start difference. First operand 120 states and 179 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-17 05:20:12,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:12,986 INFO L93 Difference]: Finished difference Result 241 states and 360 transitions. [2025-03-17 05:20:12,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:20:12,986 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 164 [2025-03-17 05:20:12,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:12,988 INFO L225 Difference]: With dead ends: 241 [2025-03-17 05:20:12,989 INFO L226 Difference]: Without dead ends: 122 [2025-03-17 05:20:12,990 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:20:12,992 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 0 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 520 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:20:12,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 520 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:20:12,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-17 05:20:13,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2025-03-17 05:20:13,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 99 states have (on average 1.404040404040404) internal successors, (139), 99 states have internal predecessors, (139), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 05:20:13,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 181 transitions. [2025-03-17 05:20:13,005 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 181 transitions. Word has length 164 [2025-03-17 05:20:13,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:13,006 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 181 transitions. [2025-03-17 05:20:13,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-17 05:20:13,006 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 181 transitions. [2025-03-17 05:20:13,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-17 05:20:13,009 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:13,011 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:13,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 05:20:13,011 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:13,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:13,011 INFO L85 PathProgramCache]: Analyzing trace with hash -240061254, now seen corresponding path program 1 times [2025-03-17 05:20:13,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:20:13,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056919683] [2025-03-17 05:20:13,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:13,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:20:13,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-17 05:20:13,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-17 05:20:13,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:13,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:13,197 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-17 05:20:13,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:20:13,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056919683] [2025-03-17 05:20:13,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056919683] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:20:13,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:20:13,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:20:13,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067989171] [2025-03-17 05:20:13,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:20:13,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:20:13,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:20:13,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:20:13,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:20:13,199 INFO L87 Difference]: Start difference. First operand 122 states and 181 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-17 05:20:13,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:13,241 INFO L93 Difference]: Finished difference Result 245 states and 364 transitions. [2025-03-17 05:20:13,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:20:13,241 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 164 [2025-03-17 05:20:13,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:13,243 INFO L225 Difference]: With dead ends: 245 [2025-03-17 05:20:13,243 INFO L226 Difference]: Without dead ends: 124 [2025-03-17 05:20:13,243 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:20:13,244 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 0 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 520 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:20:13,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 520 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:20:13,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-03-17 05:20:13,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2025-03-17 05:20:13,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 101 states have (on average 1.396039603960396) internal successors, (141), 101 states have internal predecessors, (141), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 05:20:13,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 183 transitions. [2025-03-17 05:20:13,252 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 183 transitions. Word has length 164 [2025-03-17 05:20:13,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:13,252 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 183 transitions. [2025-03-17 05:20:13,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-17 05:20:13,253 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 183 transitions. [2025-03-17 05:20:13,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-17 05:20:13,254 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:13,254 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:13,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 05:20:13,255 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:13,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:13,255 INFO L85 PathProgramCache]: Analyzing trace with hash 288857785, now seen corresponding path program 1 times [2025-03-17 05:20:13,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:20:13,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866916528] [2025-03-17 05:20:13,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:13,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:20:13,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-17 05:20:13,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-17 05:20:13,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:13,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:13,713 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-17 05:20:13,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:20:13,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866916528] [2025-03-17 05:20:13,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866916528] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:20:13,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:20:13,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:20:13,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346862085] [2025-03-17 05:20:13,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:20:13,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:20:13,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:20:13,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:20:13,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:20:13,715 INFO L87 Difference]: Start difference. First operand 124 states and 183 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 05:20:13,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:13,862 INFO L93 Difference]: Finished difference Result 354 states and 521 transitions. [2025-03-17 05:20:13,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:20:13,862 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 164 [2025-03-17 05:20:13,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:13,864 INFO L225 Difference]: With dead ends: 354 [2025-03-17 05:20:13,864 INFO L226 Difference]: Without dead ends: 231 [2025-03-17 05:20:13,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:20:13,865 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 141 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:20:13,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 1013 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:20:13,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-03-17 05:20:13,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 129. [2025-03-17 05:20:13,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 106 states have (on average 1.3962264150943395) internal successors, (148), 106 states have internal predecessors, (148), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 05:20:13,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 190 transitions. [2025-03-17 05:20:13,881 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 190 transitions. Word has length 164 [2025-03-17 05:20:13,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:13,881 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 190 transitions. [2025-03-17 05:20:13,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 05:20:13,882 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 190 transitions. [2025-03-17 05:20:13,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-17 05:20:13,883 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:13,883 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:13,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 05:20:13,883 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:13,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:13,883 INFO L85 PathProgramCache]: Analyzing trace with hash -216700840, now seen corresponding path program 1 times [2025-03-17 05:20:13,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:20:13,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674281105] [2025-03-17 05:20:13,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:13,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:20:13,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-17 05:20:13,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-17 05:20:13,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:13,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:14,127 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-17 05:20:14,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:20:14,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674281105] [2025-03-17 05:20:14,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674281105] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:20:14,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:20:14,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:20:14,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561617504] [2025-03-17 05:20:14,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:20:14,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:20:14,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:20:14,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:20:14,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:20:14,129 INFO L87 Difference]: Start difference. First operand 129 states and 190 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 05:20:14,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:14,270 INFO L93 Difference]: Finished difference Result 386 states and 569 transitions. [2025-03-17 05:20:14,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:20:14,271 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 164 [2025-03-17 05:20:14,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:14,273 INFO L225 Difference]: With dead ends: 386 [2025-03-17 05:20:14,275 INFO L226 Difference]: Without dead ends: 258 [2025-03-17 05:20:14,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:20:14,276 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 176 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:20:14,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 490 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:20:14,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-03-17 05:20:14,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 230. [2025-03-17 05:20:14,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 185 states have (on average 1.3783783783783783) internal successors, (255), 185 states have internal predecessors, (255), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-17 05:20:14,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 339 transitions. [2025-03-17 05:20:14,300 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 339 transitions. Word has length 164 [2025-03-17 05:20:14,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:14,301 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 339 transitions. [2025-03-17 05:20:14,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 05:20:14,301 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 339 transitions. [2025-03-17 05:20:14,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-17 05:20:14,304 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:14,304 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:14,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 05:20:14,305 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:14,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:14,305 INFO L85 PathProgramCache]: Analyzing trace with hash -283707593, now seen corresponding path program 1 times [2025-03-17 05:20:14,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:20:14,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117899799] [2025-03-17 05:20:14,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:14,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:20:14,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-17 05:20:14,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-17 05:20:14,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:14,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:14,896 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-17 05:20:14,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:20:14,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117899799] [2025-03-17 05:20:14,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117899799] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:20:14,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:20:14,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:20:14,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438613458] [2025-03-17 05:20:14,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:20:14,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:20:14,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:20:14,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:20:14,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:20:14,898 INFO L87 Difference]: Start difference. First operand 230 states and 339 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 05:20:15,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:15,069 INFO L93 Difference]: Finished difference Result 368 states and 543 transitions. [2025-03-17 05:20:15,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:20:15,069 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 164 [2025-03-17 05:20:15,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:15,071 INFO L225 Difference]: With dead ends: 368 [2025-03-17 05:20:15,072 INFO L226 Difference]: Without dead ends: 232 [2025-03-17 05:20:15,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:20:15,074 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 175 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:20:15,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 414 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:20:15,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-03-17 05:20:15,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2025-03-17 05:20:15,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 187 states have (on average 1.374331550802139) internal successors, (257), 187 states have internal predecessors, (257), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-17 05:20:15,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 341 transitions. [2025-03-17 05:20:15,093 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 341 transitions. Word has length 164 [2025-03-17 05:20:15,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:15,094 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 341 transitions. [2025-03-17 05:20:15,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 05:20:15,095 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 341 transitions. [2025-03-17 05:20:15,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-17 05:20:15,097 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:15,097 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:15,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 05:20:15,097 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:15,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:15,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1223844216, now seen corresponding path program 1 times [2025-03-17 05:20:15,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:20:15,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594589367] [2025-03-17 05:20:15,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:15,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:20:15,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-17 05:20:15,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-17 05:20:15,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:15,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:15,654 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-17 05:20:15,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:20:15,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594589367] [2025-03-17 05:20:15,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594589367] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:20:15,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:20:15,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:20:15,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240509637] [2025-03-17 05:20:15,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:20:15,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:20:15,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:20:15,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:20:15,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:20:15,655 INFO L87 Difference]: Start difference. First operand 232 states and 341 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 05:20:16,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:16,020 INFO L93 Difference]: Finished difference Result 492 states and 723 transitions. [2025-03-17 05:20:16,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:20:16,020 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 164 [2025-03-17 05:20:16,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:16,022 INFO L225 Difference]: With dead ends: 492 [2025-03-17 05:20:16,022 INFO L226 Difference]: Without dead ends: 356 [2025-03-17 05:20:16,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:20:16,023 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 410 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:20:16,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 594 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:20:16,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2025-03-17 05:20:16,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 228. [2025-03-17 05:20:16,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 183 states have (on average 1.349726775956284) internal successors, (247), 183 states have internal predecessors, (247), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-17 05:20:16,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 331 transitions. [2025-03-17 05:20:16,036 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 331 transitions. Word has length 164 [2025-03-17 05:20:16,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:16,037 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 331 transitions. [2025-03-17 05:20:16,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 05:20:16,037 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 331 transitions. [2025-03-17 05:20:16,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-17 05:20:16,038 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:16,038 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:16,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 05:20:16,038 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:16,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:16,039 INFO L85 PathProgramCache]: Analyzing trace with hash -987968715, now seen corresponding path program 1 times [2025-03-17 05:20:16,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:20:16,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039003140] [2025-03-17 05:20:16,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:16,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:20:16,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-17 05:20:16,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-17 05:20:16,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:16,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:16,880 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-03-17 05:20:16,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:20:16,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039003140] [2025-03-17 05:20:16,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039003140] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:20:16,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815220373] [2025-03-17 05:20:16,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:16,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:20:16,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:20:16,884 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:20:16,886 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:20:17,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-17 05:20:17,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-17 05:20:17,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:17,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:17,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-17 05:20:17,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:20:17,189 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 33 treesize of output 17 [2025-03-17 05:20:17,225 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 33 treesize of output 17 [2025-03-17 05:20:17,256 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 33 treesize of output 17 [2025-03-17 05:20:17,482 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 69 treesize of output 45 [2025-03-17 05:20:17,511 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 20 proven. 60 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:20:17,512 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:20:17,868 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-03-17 05:20:17,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1815220373] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:20:17,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 05:20:17,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 15 [2025-03-17 05:20:17,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636299183] [2025-03-17 05:20:17,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 05:20:17,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 05:20:17,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:20:17,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 05:20:17,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2025-03-17 05:20:17,870 INFO L87 Difference]: Start difference. First operand 228 states and 331 transitions. Second operand has 15 states, 12 states have (on average 6.916666666666667) internal successors, (83), 15 states have internal predecessors, (83), 4 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (43), 1 states have call predecessors, (43), 4 states have call successors, (43) [2025-03-17 05:20:18,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:18,626 INFO L93 Difference]: Finished difference Result 515 states and 733 transitions. [2025-03-17 05:20:18,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-17 05:20:18,626 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 6.916666666666667) internal successors, (83), 15 states have internal predecessors, (83), 4 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (43), 1 states have call predecessors, (43), 4 states have call successors, (43) Word has length 166 [2025-03-17 05:20:18,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:18,633 INFO L225 Difference]: With dead ends: 515 [2025-03-17 05:20:18,633 INFO L226 Difference]: Without dead ends: 378 [2025-03-17 05:20:18,634 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 325 SyntacticMatches, 6 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=251, Invalid=805, Unknown=0, NotChecked=0, Total=1056 [2025-03-17 05:20:18,634 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 1126 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1127 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:20:18,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1127 Valid, 515 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:20:18,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2025-03-17 05:20:18,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 240. [2025-03-17 05:20:18,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 193 states have (on average 1.3212435233160622) internal successors, (255), 193 states have internal predecessors, (255), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-17 05:20:18,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 339 transitions. [2025-03-17 05:20:18,663 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 339 transitions. Word has length 166 [2025-03-17 05:20:18,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:18,664 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 339 transitions. [2025-03-17 05:20:18,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 6.916666666666667) internal successors, (83), 15 states have internal predecessors, (83), 4 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (43), 1 states have call predecessors, (43), 4 states have call successors, (43) [2025-03-17 05:20:18,664 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 339 transitions. [2025-03-17 05:20:18,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-17 05:20:18,665 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:18,665 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:18,681 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:20:18,866 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,SelfDestructingSolverStorable7 [2025-03-17 05:20:18,866 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:18,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:18,870 INFO L85 PathProgramCache]: Analyzing trace with hash -944154827, now seen corresponding path program 1 times [2025-03-17 05:20:18,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:20:18,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82813507] [2025-03-17 05:20:18,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:18,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:20:18,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-17 05:20:18,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-17 05:20:18,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:18,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:19,907 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-17 05:20:19,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:20:19,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82813507] [2025-03-17 05:20:19,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82813507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:20:19,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:20:19,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 05:20:19,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657345812] [2025-03-17 05:20:19,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:20:19,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:20:19,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:20:19,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:20:19,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:20:19,909 INFO L87 Difference]: Start difference. First operand 240 states and 339 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 05:20:20,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:20,281 INFO L93 Difference]: Finished difference Result 623 states and 872 transitions. [2025-03-17 05:20:20,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:20:20,282 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 166 [2025-03-17 05:20:20,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:20,284 INFO L225 Difference]: With dead ends: 623 [2025-03-17 05:20:20,284 INFO L226 Difference]: Without dead ends: 490 [2025-03-17 05:20:20,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:20:20,285 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 274 mSDsluCounter, 1068 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 1307 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:20:20,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 1307 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:20:20,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2025-03-17 05:20:20,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 400. [2025-03-17 05:20:20,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 337 states have (on average 1.3323442136498516) internal successors, (449), 338 states have internal predecessors, (449), 55 states have call successors, (55), 7 states have call predecessors, (55), 7 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2025-03-17 05:20:20,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 559 transitions. [2025-03-17 05:20:20,323 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 559 transitions. Word has length 166 [2025-03-17 05:20:20,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:20,323 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 559 transitions. [2025-03-17 05:20:20,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 05:20:20,323 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 559 transitions. [2025-03-17 05:20:20,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-17 05:20:20,324 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:20,326 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:20,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 05:20:20,327 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:20,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:20,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1312756180, now seen corresponding path program 1 times [2025-03-17 05:20:20,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:20:20,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687672504] [2025-03-17 05:20:20,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:20,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:20:20,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-17 05:20:20,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-17 05:20:20,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:20,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:20,414 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-17 05:20:20,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:20:20,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687672504] [2025-03-17 05:20:20,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687672504] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:20:20,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:20:20,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:20:20,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751349797] [2025-03-17 05:20:20,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:20:20,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:20:20,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:20:20,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:20:20,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:20:20,417 INFO L87 Difference]: Start difference. First operand 400 states and 559 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 05:20:20,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:20,457 INFO L93 Difference]: Finished difference Result 697 states and 976 transitions. [2025-03-17 05:20:20,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:20:20,458 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 166 [2025-03-17 05:20:20,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:20,461 INFO L225 Difference]: With dead ends: 697 [2025-03-17 05:20:20,461 INFO L226 Difference]: Without dead ends: 401 [2025-03-17 05:20:20,463 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:20:20,464 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 0 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:20:20,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 519 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:20:20,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2025-03-17 05:20:20,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 401. [2025-03-17 05:20:20,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 338 states have (on average 1.319526627218935) internal successors, (446), 339 states have internal predecessors, (446), 55 states have call successors, (55), 7 states have call predecessors, (55), 7 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2025-03-17 05:20:20,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 556 transitions. [2025-03-17 05:20:20,493 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 556 transitions. Word has length 166 [2025-03-17 05:20:20,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:20,493 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 556 transitions. [2025-03-17 05:20:20,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 05:20:20,493 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 556 transitions. [2025-03-17 05:20:20,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-17 05:20:20,494 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:20,494 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:20,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 05:20:20,495 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:20,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:20,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1998715339, now seen corresponding path program 1 times [2025-03-17 05:20:20,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:20:20,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457330273] [2025-03-17 05:20:20,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:20,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:20:20,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-17 05:20:20,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-17 05:20:20,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:20,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:20,795 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-17 05:20:20,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:20:20,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457330273] [2025-03-17 05:20:20,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457330273] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:20:20,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:20:20,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:20:20,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7751279] [2025-03-17 05:20:20,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:20:20,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:20:20,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:20:20,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:20:20,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:20:20,797 INFO L87 Difference]: Start difference. First operand 401 states and 556 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 05:20:20,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:20,922 INFO L93 Difference]: Finished difference Result 969 states and 1342 transitions. [2025-03-17 05:20:20,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:20:20,923 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2025-03-17 05:20:20,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:20,926 INFO L225 Difference]: With dead ends: 969 [2025-03-17 05:20:20,926 INFO L226 Difference]: Without dead ends: 682 [2025-03-17 05:20:20,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:20:20,928 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 167 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:20:20,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 678 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:20:20,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2025-03-17 05:20:20,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 410. [2025-03-17 05:20:20,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 347 states have (on average 1.3112391930835734) internal successors, (455), 348 states have internal predecessors, (455), 55 states have call successors, (55), 7 states have call predecessors, (55), 7 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2025-03-17 05:20:20,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 565 transitions. [2025-03-17 05:20:20,960 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 565 transitions. Word has length 168 [2025-03-17 05:20:20,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:20,961 INFO L471 AbstractCegarLoop]: Abstraction has 410 states and 565 transitions. [2025-03-17 05:20:20,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 05:20:20,961 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 565 transitions. [2025-03-17 05:20:20,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-17 05:20:20,963 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:20,963 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:20,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 05:20:20,963 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:20,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:20,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1954901451, now seen corresponding path program 1 times [2025-03-17 05:20:20,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:20:20,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536923173] [2025-03-17 05:20:20,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:20,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:20:20,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-17 05:20:21,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-17 05:20:21,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:21,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:21,886 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-17 05:20:21,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:20:21,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536923173] [2025-03-17 05:20:21,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536923173] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:20:21,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:20:21,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:20:21,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139082067] [2025-03-17 05:20:21,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:20:21,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:20:21,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:20:21,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:20:21,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:20:21,893 INFO L87 Difference]: Start difference. First operand 410 states and 565 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 05:20:22,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:22,104 INFO L93 Difference]: Finished difference Result 692 states and 956 transitions. [2025-03-17 05:20:22,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:20:22,104 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2025-03-17 05:20:22,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:22,106 INFO L225 Difference]: With dead ends: 692 [2025-03-17 05:20:22,106 INFO L226 Difference]: Without dead ends: 416 [2025-03-17 05:20:22,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:20:22,108 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 136 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 1041 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:20:22,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 1041 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:20:22,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2025-03-17 05:20:22,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 372. [2025-03-17 05:20:22,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 309 states have (on average 1.3203883495145632) internal successors, (408), 310 states have internal predecessors, (408), 55 states have call successors, (55), 7 states have call predecessors, (55), 7 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2025-03-17 05:20:22,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 518 transitions. [2025-03-17 05:20:22,134 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 518 transitions. Word has length 168 [2025-03-17 05:20:22,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:22,134 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 518 transitions. [2025-03-17 05:20:22,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 05:20:22,135 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 518 transitions. [2025-03-17 05:20:22,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-17 05:20:22,137 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:22,137 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:22,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 05:20:22,137 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:22,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:22,138 INFO L85 PathProgramCache]: Analyzing trace with hash 90400935, now seen corresponding path program 1 times [2025-03-17 05:20:22,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:20:22,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599590649] [2025-03-17 05:20:22,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:22,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:20:22,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-17 05:20:22,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-17 05:20:22,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:22,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:23,010 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-17 05:20:23,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:20:23,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599590649] [2025-03-17 05:20:23,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599590649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:20:23,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:20:23,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:20:23,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422789003] [2025-03-17 05:20:23,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:20:23,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:20:23,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:20:23,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:20:23,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:20:23,012 INFO L87 Difference]: Start difference. First operand 372 states and 518 transitions. Second operand has 9 states, 8 states have (on average 8.625) internal successors, (69), 9 states have internal predecessors, (69), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-17 05:20:23,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:23,185 INFO L93 Difference]: Finished difference Result 719 states and 996 transitions. [2025-03-17 05:20:23,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:20:23,186 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.625) internal successors, (69), 9 states have internal predecessors, (69), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 171 [2025-03-17 05:20:23,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:23,188 INFO L225 Difference]: With dead ends: 719 [2025-03-17 05:20:23,188 INFO L226 Difference]: Without dead ends: 462 [2025-03-17 05:20:23,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:20:23,190 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 73 mSDsluCounter, 951 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 1123 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:20:23,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 1123 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:20:23,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2025-03-17 05:20:23,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 422. [2025-03-17 05:20:23,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 359 states have (on average 1.3036211699164346) internal successors, (468), 360 states have internal predecessors, (468), 55 states have call successors, (55), 7 states have call predecessors, (55), 7 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2025-03-17 05:20:23,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 578 transitions. [2025-03-17 05:20:23,219 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 578 transitions. Word has length 171 [2025-03-17 05:20:23,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:23,220 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 578 transitions. [2025-03-17 05:20:23,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.625) internal successors, (69), 9 states have internal predecessors, (69), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-17 05:20:23,221 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 578 transitions. [2025-03-17 05:20:23,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-17 05:20:23,222 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:23,222 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:23,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 05:20:23,223 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:23,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:23,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1114761115, now seen corresponding path program 1 times [2025-03-17 05:20:23,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:20:23,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297418927] [2025-03-17 05:20:23,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:23,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:20:23,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-17 05:20:23,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-17 05:20:23,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:23,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:23,655 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-17 05:20:23,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:20:23,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297418927] [2025-03-17 05:20:23,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297418927] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:20:23,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:20:23,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:20:23,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768912516] [2025-03-17 05:20:23,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:20:23,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:20:23,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:20:23,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:20:23,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:20:23,658 INFO L87 Difference]: Start difference. First operand 422 states and 578 transitions. Second operand has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-17 05:20:23,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:23,792 INFO L93 Difference]: Finished difference Result 867 states and 1182 transitions. [2025-03-17 05:20:23,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:20:23,792 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 173 [2025-03-17 05:20:23,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:23,795 INFO L225 Difference]: With dead ends: 867 [2025-03-17 05:20:23,796 INFO L226 Difference]: Without dead ends: 569 [2025-03-17 05:20:23,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 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:20:23,798 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 51 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:20:23,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 930 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:20:23,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2025-03-17 05:20:23,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 563. [2025-03-17 05:20:23,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 488 states have (on average 1.2971311475409837) internal successors, (633), 491 states have internal predecessors, (633), 63 states have call successors, (63), 11 states have call predecessors, (63), 11 states have return successors, (63), 60 states have call predecessors, (63), 63 states have call successors, (63) [2025-03-17 05:20:23,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 759 transitions. [2025-03-17 05:20:23,831 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 759 transitions. Word has length 173 [2025-03-17 05:20:23,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:23,832 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 759 transitions. [2025-03-17 05:20:23,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-17 05:20:23,832 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 759 transitions. [2025-03-17 05:20:23,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-17 05:20:23,833 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:23,833 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:23,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 05:20:23,833 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:23,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:23,834 INFO L85 PathProgramCache]: Analyzing trace with hash 493103225, now seen corresponding path program 1 times [2025-03-17 05:20:23,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:20:23,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996874619] [2025-03-17 05:20:23,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:23,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:20:23,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-17 05:20:23,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-17 05:20:23,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:23,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:28,441 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-17 05:20:28,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:20:28,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996874619] [2025-03-17 05:20:28,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996874619] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:20:28,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:20:28,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 05:20:28,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854958195] [2025-03-17 05:20:28,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:20:28,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 05:20:28,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:20:28,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 05:20:28,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2025-03-17 05:20:28,443 INFO L87 Difference]: Start difference. First operand 563 states and 759 transitions. Second operand has 15 states, 14 states have (on average 5.071428571428571) internal successors, (71), 15 states have internal predecessors, (71), 4 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2025-03-17 05:20:30,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:30,762 INFO L93 Difference]: Finished difference Result 1122 states and 1493 transitions. [2025-03-17 05:20:30,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-17 05:20:30,762 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 5.071428571428571) internal successors, (71), 15 states have internal predecessors, (71), 4 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) Word has length 173 [2025-03-17 05:20:30,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:30,767 INFO L225 Difference]: With dead ends: 1122 [2025-03-17 05:20:30,768 INFO L226 Difference]: Without dead ends: 1120 [2025-03-17 05:20:30,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=352, Invalid=1208, Unknown=0, NotChecked=0, Total=1560 [2025-03-17 05:20:30,770 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 1289 mSDsluCounter, 1660 mSDsCounter, 0 mSdLazyCounter, 866 mSolverCounterSat, 284 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1289 SdHoareTripleChecker+Valid, 1872 SdHoareTripleChecker+Invalid, 1150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 284 IncrementalHoareTripleChecker+Valid, 866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:20:30,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1289 Valid, 1872 Invalid, 1150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [284 Valid, 866 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-17 05:20:30,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2025-03-17 05:20:30,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 743. [2025-03-17 05:20:30,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 743 states, 659 states have (on average 1.2837632776934749) internal successors, (846), 662 states have internal predecessors, (846), 71 states have call successors, (71), 12 states have call predecessors, (71), 12 states have return successors, (71), 68 states have call predecessors, (71), 71 states have call successors, (71) [2025-03-17 05:20:30,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 988 transitions. [2025-03-17 05:20:30,819 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 988 transitions. Word has length 173 [2025-03-17 05:20:30,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:30,819 INFO L471 AbstractCegarLoop]: Abstraction has 743 states and 988 transitions. [2025-03-17 05:20:30,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 5.071428571428571) internal successors, (71), 15 states have internal predecessors, (71), 4 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2025-03-17 05:20:30,820 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 988 transitions. [2025-03-17 05:20:30,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-17 05:20:30,822 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:30,822 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:30,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 05:20:30,822 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:30,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:30,823 INFO L85 PathProgramCache]: Analyzing trace with hash -2019599164, now seen corresponding path program 1 times [2025-03-17 05:20:30,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:20:30,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490726368] [2025-03-17 05:20:30,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:30,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:20:30,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-17 05:20:30,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-17 05:20:30,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:30,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:31,192 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-17 05:20:31,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:20:31,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490726368] [2025-03-17 05:20:31,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490726368] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:20:31,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:20:31,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:20:31,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829938550] [2025-03-17 05:20:31,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:20:31,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:20:31,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:20:31,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:20:31,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:20:31,195 INFO L87 Difference]: Start difference. First operand 743 states and 988 transitions. Second operand has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-17 05:20:31,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:31,323 INFO L93 Difference]: Finished difference Result 1380 states and 1834 transitions. [2025-03-17 05:20:31,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:20:31,323 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 173 [2025-03-17 05:20:31,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:31,327 INFO L225 Difference]: With dead ends: 1380 [2025-03-17 05:20:31,327 INFO L226 Difference]: Without dead ends: 832 [2025-03-17 05:20:31,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 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:20:31,330 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 86 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:20:31,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 615 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:20:31,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2025-03-17 05:20:31,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 747. [2025-03-17 05:20:31,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 747 states, 662 states have (on average 1.2779456193353473) internal successors, (846), 665 states have internal predecessors, (846), 71 states have call successors, (71), 13 states have call predecessors, (71), 13 states have return successors, (71), 68 states have call predecessors, (71), 71 states have call successors, (71) [2025-03-17 05:20:31,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 988 transitions. [2025-03-17 05:20:31,373 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 988 transitions. Word has length 173 [2025-03-17 05:20:31,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:31,374 INFO L471 AbstractCegarLoop]: Abstraction has 747 states and 988 transitions. [2025-03-17 05:20:31,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-17 05:20:31,374 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 988 transitions. [2025-03-17 05:20:31,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-17 05:20:31,375 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:31,376 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:31,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 05:20:31,376 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:31,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:31,376 INFO L85 PathProgramCache]: Analyzing trace with hash 478416773, now seen corresponding path program 1 times [2025-03-17 05:20:31,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:20:31,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088797099] [2025-03-17 05:20:31,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:31,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:20:31,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-17 05:20:31,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-17 05:20:31,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:31,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:31,739 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-17 05:20:31,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:20:31,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088797099] [2025-03-17 05:20:31,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088797099] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:20:31,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:20:31,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 05:20:31,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938407420] [2025-03-17 05:20:31,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:20:31,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:20:31,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:20:31,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:20:31,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:20:31,742 INFO L87 Difference]: Start difference. First operand 747 states and 988 transitions. Second operand has 8 states, 7 states have (on average 10.142857142857142) internal successors, (71), 8 states have internal predecessors, (71), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-17 05:20:31,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:31,931 INFO L93 Difference]: Finished difference Result 1327 states and 1760 transitions. [2025-03-17 05:20:31,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:20:31,931 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.142857142857142) internal successors, (71), 8 states have internal predecessors, (71), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 173 [2025-03-17 05:20:31,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:31,935 INFO L225 Difference]: With dead ends: 1327 [2025-03-17 05:20:31,935 INFO L226 Difference]: Without dead ends: 779 [2025-03-17 05:20:31,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:20:31,937 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 166 mSDsluCounter, 791 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 967 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:20:31,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 967 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:20:31,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2025-03-17 05:20:31,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 775. [2025-03-17 05:20:31,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 775 states, 684 states have (on average 1.2690058479532165) internal successors, (868), 687 states have internal predecessors, (868), 75 states have call successors, (75), 15 states have call predecessors, (75), 15 states have return successors, (75), 72 states have call predecessors, (75), 75 states have call successors, (75) [2025-03-17 05:20:31,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1018 transitions. [2025-03-17 05:20:31,988 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1018 transitions. Word has length 173 [2025-03-17 05:20:31,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:31,988 INFO L471 AbstractCegarLoop]: Abstraction has 775 states and 1018 transitions. [2025-03-17 05:20:31,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.142857142857142) internal successors, (71), 8 states have internal predecessors, (71), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-17 05:20:31,988 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1018 transitions. [2025-03-17 05:20:31,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-17 05:20:31,990 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:31,990 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:31,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 05:20:31,991 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:31,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:31,991 INFO L85 PathProgramCache]: Analyzing trace with hash 185013766, now seen corresponding path program 1 times [2025-03-17 05:20:31,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:20:31,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910238467] [2025-03-17 05:20:31,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:31,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:20:32,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-17 05:20:32,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-17 05:20:32,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:32,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:32,169 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-17 05:20:32,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:20:32,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910238467] [2025-03-17 05:20:32,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910238467] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:20:32,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:20:32,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:20:32,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735224380] [2025-03-17 05:20:32,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:20:32,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:20:32,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:20:32,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:20:32,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:20:32,170 INFO L87 Difference]: Start difference. First operand 775 states and 1018 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 05:20:32,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:32,412 INFO L93 Difference]: Finished difference Result 1666 states and 2205 transitions. [2025-03-17 05:20:32,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:20:32,413 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 173 [2025-03-17 05:20:32,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:32,417 INFO L225 Difference]: With dead ends: 1666 [2025-03-17 05:20:32,417 INFO L226 Difference]: Without dead ends: 1090 [2025-03-17 05:20:32,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:20:32,419 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 239 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:20:32,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 631 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:20:32,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2025-03-17 05:20:32,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 876. [2025-03-17 05:20:32,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 876 states, 785 states have (on average 1.2522292993630573) internal successors, (983), 788 states have internal predecessors, (983), 75 states have call successors, (75), 15 states have call predecessors, (75), 15 states have return successors, (75), 72 states have call predecessors, (75), 75 states have call successors, (75) [2025-03-17 05:20:32,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1133 transitions. [2025-03-17 05:20:32,470 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1133 transitions. Word has length 173 [2025-03-17 05:20:32,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:32,470 INFO L471 AbstractCegarLoop]: Abstraction has 876 states and 1133 transitions. [2025-03-17 05:20:32,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 05:20:32,470 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1133 transitions. [2025-03-17 05:20:32,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-17 05:20:32,472 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:32,472 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:32,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 05:20:32,472 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:32,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:32,473 INFO L85 PathProgramCache]: Analyzing trace with hash -153147098, now seen corresponding path program 1 times [2025-03-17 05:20:32,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:20:32,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377289045] [2025-03-17 05:20:32,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:32,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:20:32,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-17 05:20:32,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-17 05:20:32,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:32,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:32,859 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-17 05:20:32,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:20:32,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377289045] [2025-03-17 05:20:32,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377289045] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:20:32,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:20:32,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 05:20:32,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140545268] [2025-03-17 05:20:32,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:20:32,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:20:32,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:20:32,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:20:32,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:20:32,861 INFO L87 Difference]: Start difference. First operand 876 states and 1133 transitions. Second operand has 8 states, 7 states have (on average 10.142857142857142) internal successors, (71), 8 states have internal predecessors, (71), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-17 05:20:33,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:33,061 INFO L93 Difference]: Finished difference Result 1624 states and 2105 transitions. [2025-03-17 05:20:33,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 05:20:33,062 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.142857142857142) internal successors, (71), 8 states have internal predecessors, (71), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 173 [2025-03-17 05:20:33,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:33,065 INFO L225 Difference]: With dead ends: 1624 [2025-03-17 05:20:33,065 INFO L226 Difference]: Without dead ends: 985 [2025-03-17 05:20:33,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:20:33,066 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 145 mSDsluCounter, 870 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 1078 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:20:33,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 1078 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:20:33,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2025-03-17 05:20:33,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 981. [2025-03-17 05:20:33,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 873 states have (on average 1.2485681557846506) internal successors, (1090), 878 states have internal predecessors, (1090), 87 states have call successors, (87), 20 states have call predecessors, (87), 20 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) [2025-03-17 05:20:33,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1264 transitions. [2025-03-17 05:20:33,119 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1264 transitions. Word has length 173 [2025-03-17 05:20:33,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:33,120 INFO L471 AbstractCegarLoop]: Abstraction has 981 states and 1264 transitions. [2025-03-17 05:20:33,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.142857142857142) internal successors, (71), 8 states have internal predecessors, (71), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-17 05:20:33,120 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1264 transitions. [2025-03-17 05:20:33,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-17 05:20:33,121 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:33,121 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:33,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 05:20:33,121 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:33,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:33,122 INFO L85 PathProgramCache]: Analyzing trace with hash 539954599, now seen corresponding path program 1 times [2025-03-17 05:20:33,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:20:33,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454098931] [2025-03-17 05:20:33,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:33,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:20:33,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-17 05:20:33,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-17 05:20:33,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:33,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:33,303 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-17 05:20:33,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:20:33,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454098931] [2025-03-17 05:20:33,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454098931] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:20:33,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:20:33,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:20:33,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481063829] [2025-03-17 05:20:33,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:20:33,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:20:33,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:20:33,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:20:33,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:20:33,306 INFO L87 Difference]: Start difference. First operand 981 states and 1264 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 05:20:33,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:33,564 INFO L93 Difference]: Finished difference Result 1836 states and 2384 transitions. [2025-03-17 05:20:33,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:20:33,565 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 173 [2025-03-17 05:20:33,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:33,569 INFO L225 Difference]: With dead ends: 1836 [2025-03-17 05:20:33,569 INFO L226 Difference]: Without dead ends: 1096 [2025-03-17 05:20:33,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:20:33,570 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 227 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:20:33,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 535 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:20:33,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1096 states. [2025-03-17 05:20:33,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1096 to 1072. [2025-03-17 05:20:33,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1072 states, 940 states have (on average 1.2468085106382978) internal successors, (1172), 945 states have internal predecessors, (1172), 109 states have call successors, (109), 22 states have call predecessors, (109), 22 states have return successors, (109), 104 states have call predecessors, (109), 109 states have call successors, (109) [2025-03-17 05:20:33,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1390 transitions. [2025-03-17 05:20:33,641 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1390 transitions. Word has length 173 [2025-03-17 05:20:33,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:33,642 INFO L471 AbstractCegarLoop]: Abstraction has 1072 states and 1390 transitions. [2025-03-17 05:20:33,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 05:20:33,642 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1390 transitions. [2025-03-17 05:20:33,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-17 05:20:33,643 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:33,643 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:33,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 05:20:33,644 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:33,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:33,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1405700152, now seen corresponding path program 1 times [2025-03-17 05:20:33,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:20:33,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558226225] [2025-03-17 05:20:33,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:33,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:20:33,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-17 05:20:33,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-17 05:20:33,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:33,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:20:33,700 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 05:20:33,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-17 05:20:33,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-17 05:20:33,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:33,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:20:33,823 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 05:20:33,824 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 05:20:33,824 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 05:20:33,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 05:20:33,828 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:20:33,910 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 05:20:33,912 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 05:20:33 BoogieIcfgContainer [2025-03-17 05:20:33,912 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 05:20:33,912 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 05:20:33,913 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 05:20:33,913 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 05:20:33,913 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:20:11" (3/4) ... [2025-03-17 05:20:33,915 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 05:20:33,915 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 05:20:33,916 INFO L158 Benchmark]: Toolchain (without parser) took 23225.40ms. Allocated memory was 167.8MB in the beginning and 671.1MB in the end (delta: 503.3MB). Free memory was 127.9MB in the beginning and 462.6MB in the end (delta: -334.6MB). Peak memory consumption was 171.2MB. Max. memory is 16.1GB. [2025-03-17 05:20:33,916 INFO L158 Benchmark]: CDTParser took 1.83ms. Allocated memory is still 226.5MB. Free memory is still 143.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:20:33,916 INFO L158 Benchmark]: CACSL2BoogieTranslator took 237.60ms. Allocated memory is still 167.8MB. Free memory was 127.9MB in the beginning and 112.4MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 05:20:33,916 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.24ms. Allocated memory is still 167.8MB. Free memory was 112.4MB in the beginning and 108.1MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:20:33,916 INFO L158 Benchmark]: Boogie Preprocessor took 68.18ms. Allocated memory is still 167.8MB. Free memory was 108.1MB in the beginning and 103.1MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 05:20:33,916 INFO L158 Benchmark]: IcfgBuilder took 575.91ms. Allocated memory is still 167.8MB. Free memory was 103.1MB in the beginning and 65.3MB in the end (delta: 37.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 05:20:33,917 INFO L158 Benchmark]: TraceAbstraction took 22290.54ms. Allocated memory was 167.8MB in the beginning and 671.1MB in the end (delta: 503.3MB). Free memory was 64.8MB in the beginning and 462.7MB in the end (delta: -397.9MB). Peak memory consumption was 104.1MB. Max. memory is 16.1GB. [2025-03-17 05:20:33,917 INFO L158 Benchmark]: Witness Printer took 2.81ms. Allocated memory is still 671.1MB. Free memory was 462.7MB in the beginning and 462.6MB in the end (delta: 92.0kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 05:20:33,918 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.83ms. Allocated memory is still 226.5MB. Free memory is still 143.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 237.60ms. Allocated memory is still 167.8MB. Free memory was 127.9MB in the beginning and 112.4MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.24ms. Allocated memory is still 167.8MB. Free memory was 112.4MB in the beginning and 108.1MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 68.18ms. Allocated memory is still 167.8MB. Free memory was 108.1MB in the beginning and 103.1MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 575.91ms. Allocated memory is still 167.8MB. Free memory was 103.1MB in the beginning and 65.3MB in the end (delta: 37.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 22290.54ms. Allocated memory was 167.8MB in the beginning and 671.1MB in the end (delta: 503.3MB). Free memory was 64.8MB in the beginning and 462.7MB in the end (delta: -397.9MB). Peak memory consumption was 104.1MB. Max. memory is 16.1GB. * Witness Printer took 2.81ms. Allocated memory is still 671.1MB. Free memory was 462.7MB in the beginning and 462.6MB in the end (delta: 92.0kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 49, overapproximation of someBinaryFLOATComparisonOperation at line 86, overapproximation of someBinaryFLOATComparisonOperation at line 107, overapproximation of someBinaryFLOATComparisonOperation at line 89, overapproximation of someBinaryFLOATComparisonOperation at line 87, overapproximation of someBinaryFLOATComparisonOperation at line 89, overapproximation of someBinaryFLOATComparisonOperation at line 84, overapproximation of someBinaryFLOATComparisonOperation at line 84, overapproximation of someBinaryFLOATComparisonOperation at line 86, overapproximation of someBinaryDOUBLEComparisonOperation at line 82, overapproximation of someBinaryDOUBLEComparisonOperation at line 82, overapproximation of someBinaryDOUBLEComparisonOperation at line 50. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 1, 0, 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 1, 0, 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 1, 0, 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 1, 0, 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 1, 0, 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 1, 0, 1, 0 }; [L25-L27] double double_Array_0[1] = { 8.6 }; [L25-L27] double double_Array_0[1] = { 8.6 }; [L28-L30] float float_Array_0[3] = { 32.25, 15.5, 256.25 }; [L28-L30] float float_Array_0[3] = { 32.25, 15.5, 256.25 }; [L28-L30] float float_Array_0[3] = { 32.25, 15.5, 256.25 }; [L28-L30] float float_Array_0[3] = { 32.25, 15.5, 256.25 }; [L31-L33] signed long int signed_long_int_Array_0[1] = { 1000000 }; [L31-L33] signed long int signed_long_int_Array_0[1] = { 1000000 }; [L34-L36] signed short int signed_short_int_Array_0[2][2] = { {8, -64}, {10, -64} }; [L34-L36] signed short int signed_short_int_Array_0[2][2] = { {8, -64}, {10, -64} }; [L34-L36] signed short int signed_short_int_Array_0[2][2] = { {8, -64}, {10, -64} }; [L34-L36] signed short int signed_short_int_Array_0[2][2] = { {8, -64}, {10, -64} }; [L34-L36] signed short int signed_short_int_Array_0[2][2] = { {8, -64}, {10, -64} }; [L37-L39] unsigned short int unsigned_short_int_Array_0[2] = { 2, 57581 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[2] = { 2, 57581 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[2] = { 2, 57581 }; [L40] unsigned char last_1_BOOL_unsigned_char_Array_0_0_ = 0; [L111] isInitial = 1 [L112] FCALL initially() [L113] COND TRUE 1 [L114] CALL updateLastVariables() [L104] EXPR BOOL_unsigned_char_Array_0[0] [L104] last_1_BOOL_unsigned_char_Array_0_0_ = BOOL_unsigned_char_Array_0[0] [L114] RET updateLastVariables() [L115] CALL updateVariables() [L69] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L70] EXPR BOOL_unsigned_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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L70] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L70] RET assume_abort_if_not(BOOL_unsigned_char_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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L71] EXPR BOOL_unsigned_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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L71] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L71] RET assume_abort_if_not(BOOL_unsigned_char_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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L72] BOOL_unsigned_char_Array_0[2] = __VERIFIER_nondet_uchar() [L73] EXPR BOOL_unsigned_char_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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L73] CALL assume_abort_if_not(BOOL_unsigned_char_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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L73] RET assume_abort_if_not(BOOL_unsigned_char_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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] EXPR BOOL_unsigned_char_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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[2] <= 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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[2] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L75] BOOL_unsigned_char_Array_0[3] = __VERIFIER_nondet_uchar() [L76] EXPR BOOL_unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[3] >= 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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[3] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] EXPR BOOL_unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[3] <= 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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[3] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] BOOL_unsigned_char_Array_0[4] = __VERIFIER_nondet_uchar() [L79] EXPR BOOL_unsigned_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[4] >= 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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[4] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] EXPR BOOL_unsigned_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[4] <= 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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] RET assume_abort_if_not(BOOL_unsigned_char_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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] double_Array_0[0] = __VERIFIER_nondet_double() [L82] EXPR double_Array_0[0] [L82] 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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F [L82] EXPR double_Array_0[0] [L82] 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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] EXPR (double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] EXPR (double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] CALL assume_abort_if_not((double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] RET assume_abort_if_not((double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] float_Array_0[0] = __VERIFIER_nondet_float() [L84] EXPR float_Array_0[0] [L84] EXPR float_Array_0[0] >= -922337.2036854776000e+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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F [L84] EXPR float_Array_0[0] [L84] EXPR float_Array_0[0] >= -922337.2036854776000e+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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] EXPR (float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] EXPR (float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] CALL assume_abort_if_not((float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] RET assume_abort_if_not((float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L85] float_Array_0[1] = __VERIFIER_nondet_float() [L86] EXPR float_Array_0[1] [L86] EXPR float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] EXPR float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F [L86] EXPR float_Array_0[1] [L86] EXPR float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] EXPR (float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] EXPR (float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] CALL assume_abort_if_not((float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] RET assume_abort_if_not((float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L87] 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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L87] CALL assume_abort_if_not(float_Array_0[1] != 0.0F) 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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L87] RET assume_abort_if_not(float_Array_0[1] != 0.0F) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L88] float_Array_0[2] = __VERIFIER_nondet_float() [L89] EXPR float_Array_0[2] [L89] EXPR float_Array_0[2] >= -922337.2036854776000e+13F && float_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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F [L89] EXPR float_Array_0[2] [L89] EXPR float_Array_0[2] >= -922337.2036854776000e+13F && float_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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR (float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR (float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] CALL assume_abort_if_not((float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] RET assume_abort_if_not((float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L90] signed_short_int_Array_0[0][0] = __VERIFIER_nondet_short() [L91] EXPR signed_short_int_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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L91] CALL assume_abort_if_not(signed_short_int_Array_0[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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L91] RET assume_abort_if_not(signed_short_int_Array_0[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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] EXPR signed_short_int_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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] CALL assume_abort_if_not(signed_short_int_Array_0[0][0] <= 32766) 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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] RET assume_abort_if_not(signed_short_int_Array_0[0][0] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L93] signed_short_int_Array_0[1][0] = __VERIFIER_nondet_short() [L94] EXPR signed_short_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L94] CALL assume_abort_if_not(signed_short_int_Array_0[1][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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L94] RET assume_abort_if_not(signed_short_int_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR signed_short_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] CALL assume_abort_if_not(signed_short_int_Array_0[1][0] <= 16383) 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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] RET assume_abort_if_not(signed_short_int_Array_0[1][0] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] signed_short_int_Array_0[0][1] = __VERIFIER_nondet_short() [L97] EXPR signed_short_int_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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L97] CALL assume_abort_if_not(signed_short_int_Array_0[0][1] >= -32767) 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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L97] RET assume_abort_if_not(signed_short_int_Array_0[0][1] >= -32767) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L98] EXPR signed_short_int_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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L98] CALL assume_abort_if_not(signed_short_int_Array_0[0][1] <= 32766) 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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L98] RET assume_abort_if_not(signed_short_int_Array_0[0][1] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L99] unsigned_short_int_Array_0[1] = __VERIFIER_nondet_ushort() [L100] EXPR unsigned_short_int_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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] CALL assume_abort_if_not(unsigned_short_int_Array_0[1] >= 32767) 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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] RET assume_abort_if_not(unsigned_short_int_Array_0[1] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR unsigned_short_int_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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] CALL assume_abort_if_not(unsigned_short_int_Array_0[1] <= 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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] RET assume_abort_if_not(unsigned_short_int_Array_0[1] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L115] RET updateVariables() [L116] CALL step() [L44] COND FALSE !(\read(last_1_BOOL_unsigned_char_Array_0_0_)) [L47] EXPR signed_short_int_Array_0[1][0] [L47] EXPR signed_short_int_Array_0[0][0] [L47] signed_short_int_Array_0[1][1] = ((signed_short_int_Array_0[1][0] + 16) - signed_short_int_Array_0[0][0]) [L49] EXPR float_Array_0[0] [L49] EXPR float_Array_0[1] [L49] EXPR float_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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L49] COND TRUE (float_Array_0[0] / float_Array_0[1]) <= float_Array_0[2] [L50] EXPR double_Array_0[0] [L50] 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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L50] COND TRUE (double_Array_0[0] - 2.3) > float_Array_0[1] [L51] EXPR unsigned_short_int_Array_0[1] [L51] EXPR signed_short_int_Array_0[1][0] [L51] unsigned_short_int_Array_0[0] = (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[1][0]) [L58] EXPR signed_short_int_Array_0[1][1] [L58] EXPR unsigned_short_int_Array_0[0] [L58] EXPR (signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L58] EXPR (signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4] [L58] EXPR BOOL_unsigned_char_Array_0[4] [L58] EXPR (signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L58] ((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L58] ((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3] [L58] EXPR BOOL_unsigned_char_Array_0[3] [L58] ((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L58] COND TRUE ((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3] [L59] EXPR BOOL_unsigned_char_Array_0[1] [L59] BOOL_unsigned_char_Array_0[0] = (! BOOL_unsigned_char_Array_0[1]) [L63] EXPR BOOL_unsigned_char_Array_0[0] [L63] unsigned char stepLocal_0 = BOOL_unsigned_char_Array_0[0]; [L64] stepLocal_0 && 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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L64] stepLocal_0 && 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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L64] COND FALSE !(stepLocal_0 && BOOL_unsigned_char_Array_0[0]) [L116] RET step() [L117] CALL, EXPR property() [L107] EXPR BOOL_unsigned_char_Array_0[0] [L107] EXPR BOOL_unsigned_char_Array_0[0] && 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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR BOOL_unsigned_char_Array_0[0] && 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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_short_int_Array_0[1][1])) : 1 [L107] EXPR (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_short_int_Array_0[1][1])) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR ((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_short_int_Array_0[1][1])) : 1) && (last_1_BOOL_unsigned_char_Array_0_0_ ? (signed_short_int_Array_0[1][1] == ((signed short int) signed_short_int_Array_0[0][1])) : (signed_short_int_Array_0[1][1] == ((signed short int) ((signed_short_int_Array_0[1][0] + 16) - signed_short_int_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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR ((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_short_int_Array_0[1][1])) : 1) && (last_1_BOOL_unsigned_char_Array_0_0_ ? (signed_short_int_Array_0[1][1] == ((signed short int) signed_short_int_Array_0[0][1])) : (signed_short_int_Array_0[1][1] == ((signed short int) ((signed_short_int_Array_0[1][0] + 16) - signed_short_int_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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR last_1_BOOL_unsigned_char_Array_0_0_ ? (signed_short_int_Array_0[1][1] == ((signed short int) signed_short_int_Array_0[0][1])) : (signed_short_int_Array_0[1][1] == ((signed short int) ((signed_short_int_Array_0[1][0] + 16) - signed_short_int_Array_0[0][0]))) [L107] EXPR signed_short_int_Array_0[1][1] [L107] EXPR signed_short_int_Array_0[1][0] [L107] EXPR signed_short_int_Array_0[0][0] [L107] EXPR last_1_BOOL_unsigned_char_Array_0_0_ ? (signed_short_int_Array_0[1][1] == ((signed short int) signed_short_int_Array_0[0][1])) : (signed_short_int_Array_0[1][1] == ((signed short int) ((signed_short_int_Array_0[1][0] + 16) - signed_short_int_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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR ((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_short_int_Array_0[1][1])) : 1) && (last_1_BOOL_unsigned_char_Array_0_0_ ? (signed_short_int_Array_0[1][1] == ((signed short int) signed_short_int_Array_0[0][1])) : (signed_short_int_Array_0[1][1] == ((signed short int) ((signed_short_int_Array_0[1][0] + 16) - signed_short_int_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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR (((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_short_int_Array_0[1][1])) : 1) && (last_1_BOOL_unsigned_char_Array_0_0_ ? (signed_short_int_Array_0[1][1] == ((signed short int) signed_short_int_Array_0[0][1])) : (signed_short_int_Array_0[1][1] == ((signed short int) ((signed_short_int_Array_0[1][0] + 16) - signed_short_int_Array_0[0][0]))))) && ((((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR (((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_short_int_Array_0[1][1])) : 1) && (last_1_BOOL_unsigned_char_Array_0_0_ ? (signed_short_int_Array_0[1][1] == ((signed short int) signed_short_int_Array_0[0][1])) : (signed_short_int_Array_0[1][1] == ((signed short int) ((signed_short_int_Array_0[1][0] + 16) - signed_short_int_Array_0[0][0]))))) && ((((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]))))) [L107] EXPR signed_short_int_Array_0[1][1] [L107] EXPR unsigned_short_int_Array_0[0] [L107] EXPR (signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR (signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4] [L107] EXPR BOOL_unsigned_char_Array_0[4] [L107] EXPR (signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR ((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR ((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3] [L107] EXPR BOOL_unsigned_char_Array_0[3] [L107] EXPR ((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR (((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1])))) [L107] EXPR BOOL_unsigned_char_Array_0[0] [L107] EXPR BOOL_unsigned_char_Array_0[1] [L107] EXPR (((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR (((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_short_int_Array_0[1][1])) : 1) && (last_1_BOOL_unsigned_char_Array_0_0_ ? (signed_short_int_Array_0[1][1] == ((signed short int) signed_short_int_Array_0[0][1])) : (signed_short_int_Array_0[1][1] == ((signed short int) ((signed_short_int_Array_0[1][0] + 16) - signed_short_int_Array_0[0][0]))))) && ((((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR ((((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_short_int_Array_0[1][1])) : 1) && (last_1_BOOL_unsigned_char_Array_0_0_ ? (signed_short_int_Array_0[1][1] == ((signed short int) signed_short_int_Array_0[0][1])) : (signed_short_int_Array_0[1][1] == ((signed short int) ((signed_short_int_Array_0[1][0] + 16) - signed_short_int_Array_0[0][0]))))) && ((((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1])))))) && (((float_Array_0[0] / float_Array_0[1]) <= float_Array_0[2]) ? (((double_Array_0[0] - 2.3) > float_Array_0[1]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[1][0]))) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_short_int_Array_0[1][0]) > (((((unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) < 0 ) ? -(unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) : (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]))))) ? (signed_short_int_Array_0[1][0]) : (((((unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) < 0 ) ? -(unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) : (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]))))))))) : (unsigned_short_int_Array_0[0] == ((unsigned short int) signed_short_int_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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR ((((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_short_int_Array_0[1][1])) : 1) && (last_1_BOOL_unsigned_char_Array_0_0_ ? (signed_short_int_Array_0[1][1] == ((signed short int) signed_short_int_Array_0[0][1])) : (signed_short_int_Array_0[1][1] == ((signed short int) ((signed_short_int_Array_0[1][0] + 16) - signed_short_int_Array_0[0][0]))))) && ((((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1])))))) && (((float_Array_0[0] / float_Array_0[1]) <= float_Array_0[2]) ? (((double_Array_0[0] - 2.3) > float_Array_0[1]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[1][0]))) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_short_int_Array_0[1][0]) > (((((unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) < 0 ) ? -(unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) : (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]))))) ? (signed_short_int_Array_0[1][0]) : (((((unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) < 0 ) ? -(unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) : (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]))))))))) : (unsigned_short_int_Array_0[0] == ((unsigned short int) signed_short_int_Array_0[0][0]))) [L107] EXPR float_Array_0[0] [L107] EXPR float_Array_0[1] [L107] EXPR float_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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR ((float_Array_0[0] / float_Array_0[1]) <= float_Array_0[2]) ? (((double_Array_0[0] - 2.3) > float_Array_0[1]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[1][0]))) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_short_int_Array_0[1][0]) > (((((unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) < 0 ) ? -(unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) : (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]))))) ? (signed_short_int_Array_0[1][0]) : (((((unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) < 0 ) ? -(unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) : (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]))))))))) : (unsigned_short_int_Array_0[0] == ((unsigned short int) signed_short_int_Array_0[0][0])) [L107] EXPR unsigned_short_int_Array_0[0] [L107] EXPR signed_short_int_Array_0[0][0] [L107] EXPR ((float_Array_0[0] / float_Array_0[1]) <= float_Array_0[2]) ? (((double_Array_0[0] - 2.3) > float_Array_0[1]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[1][0]))) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_short_int_Array_0[1][0]) > (((((unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) < 0 ) ? -(unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) : (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]))))) ? (signed_short_int_Array_0[1][0]) : (((((unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) < 0 ) ? -(unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) : (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]))))))))) : (unsigned_short_int_Array_0[0] == ((unsigned short int) signed_short_int_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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR ((((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_short_int_Array_0[1][1])) : 1) && (last_1_BOOL_unsigned_char_Array_0_0_ ? (signed_short_int_Array_0[1][1] == ((signed short int) signed_short_int_Array_0[0][1])) : (signed_short_int_Array_0[1][1] == ((signed short int) ((signed_short_int_Array_0[1][0] + 16) - signed_short_int_Array_0[0][0]))))) && ((((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1])))))) && (((float_Array_0[0] / float_Array_0[1]) <= float_Array_0[2]) ? (((double_Array_0[0] - 2.3) > float_Array_0[1]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[1][0]))) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_short_int_Array_0[1][0]) > (((((unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) < 0 ) ? -(unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) : (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]))))) ? (signed_short_int_Array_0[1][0]) : (((((unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) < 0 ) ? -(unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) : (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]))))))))) : (unsigned_short_int_Array_0[0] == ((unsigned short int) signed_short_int_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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107-L108] return ((((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_short_int_Array_0[1][1])) : 1) && (last_1_BOOL_unsigned_char_Array_0_0_ ? (signed_short_int_Array_0[1][1] == ((signed short int) signed_short_int_Array_0[0][1])) : (signed_short_int_Array_0[1][1] == ((signed short int) ((signed_short_int_Array_0[1][0] + 16) - signed_short_int_Array_0[0][0]))))) && ((((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1])))))) && (((float_Array_0[0] / float_Array_0[1]) <= float_Array_0[2]) ? (((double_Array_0[0] - 2.3) > float_Array_0[1]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[1][0]))) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_short_int_Array_0[1][0]) > (((((unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) < 0 ) ? -(unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) : (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]))))) ? (signed_short_int_Array_0[1][0]) : (((((unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) < 0 ) ? -(unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) : (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]))))))))) : (unsigned_short_int_Array_0[0] == ((unsigned short int) signed_short_int_Array_0[0][0]))) ; [L117] RET, EXPR property() [L117] 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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_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_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 122 locations, 204 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.2s, OverallIterations: 21, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4887 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4881 mSDsluCounter, 15541 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11672 mSDsCounter, 832 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3561 IncrementalHoareTripleChecker+Invalid, 4393 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 832 mSolverCounterUnsat, 3869 mSDtfsCounter, 3561 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 732 GetRequests, 564 SyntacticMatches, 6 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1072occurred in iteration=20, InterpolantAutomatonStates: 159, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 20 MinimizatonAttempts, 1556 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 12.9s InterpolantComputationTime, 3868 NumberOfCodeBlocks, 3868 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 3837 ConstructedInterpolants, 0 QuantifiedInterpolants, 15897 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1122 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 23 InterpolantComputations, 19 PerfectInterpolantSequences, 19100/19320 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:20:33,936 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-14.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 fa1f0900915e9d0a4bf98ef205532704c7807bfe3d7587fb7faefc96b22ae06b --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:20:36,059 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:20:36,153 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 05:20:36,158 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:20:36,160 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:20:36,186 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:20:36,186 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:20:36,187 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:20:36,187 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:20:36,187 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:20:36,188 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:20:36,188 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:20:36,188 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:20:36,189 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:20:36,189 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:20:36,189 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:20:36,189 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:20:36,189 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:20:36,189 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:20:36,189 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:20:36,189 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:20:36,189 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:20:36,190 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:20:36,190 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 05:20:36,190 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 05:20:36,190 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 05:20:36,190 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:20:36,190 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:20:36,190 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:20:36,190 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:20:36,190 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:20:36,191 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:20:36,191 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:20:36,191 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:20:36,191 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:20:36,191 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:20:36,191 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:20:36,191 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:20:36,191 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:20:36,191 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 05:20:36,191 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 05:20:36,191 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:20:36,191 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:20:36,191 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:20:36,191 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:20:36,191 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 -> fa1f0900915e9d0a4bf98ef205532704c7807bfe3d7587fb7faefc96b22ae06b [2025-03-17 05:20:36,419 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:20:36,428 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:20:36,430 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:20:36,431 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:20:36,432 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:20:36,433 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-14.i [2025-03-17 05:20:37,682 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ba005568/985f78d18da94bfda8243901ac0c764c/FLAG749232cde [2025-03-17 05:20:37,898 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:20:37,899 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-14.i [2025-03-17 05:20:37,907 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ba005568/985f78d18da94bfda8243901ac0c764c/FLAG749232cde [2025-03-17 05:20:38,266 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ba005568/985f78d18da94bfda8243901ac0c764c [2025-03-17 05:20:38,269 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:20:38,270 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:20:38,271 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:20:38,272 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:20:38,279 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:20:38,280 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:20:38" (1/1) ... [2025-03-17 05:20:38,280 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ad6ee5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:20:38, skipping insertion in model container [2025-03-17 05:20:38,280 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:20:38" (1/1) ... [2025-03-17 05:20:38,308 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:20:38,427 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-14.i[916,929] [2025-03-17 05:20:38,477 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:20:38,491 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:20:38,499 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-14.i[916,929] [2025-03-17 05:20:38,532 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:20:38,556 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:20:38,557 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:20:38 WrapperNode [2025-03-17 05:20:38,557 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:20:38,558 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:20:38,558 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:20:38,558 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:20:38,563 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:20:38" (1/1) ... [2025-03-17 05:20:38,584 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:20:38" (1/1) ... [2025-03-17 05:20:38,626 INFO L138 Inliner]: procedures = 39, calls = 188, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 563 [2025-03-17 05:20:38,627 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:20:38,627 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:20:38,627 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:20:38,628 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:20:38,633 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:20:38" (1/1) ... [2025-03-17 05:20:38,634 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:20:38" (1/1) ... [2025-03-17 05:20:38,639 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:20:38" (1/1) ... [2025-03-17 05:20:38,656 INFO L175 MemorySlicer]: Split 150 memory accesses to 7 slices as follows [2, 36, 8, 27, 3, 47, 27]. 31 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 5, 1, 3, 1, 4, 2]. The 20 writes are split as follows [0, 6, 1, 3, 1, 5, 4]. [2025-03-17 05:20:38,656 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:20:38" (1/1) ... [2025-03-17 05:20:38,656 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:20:38" (1/1) ... [2025-03-17 05:20:38,688 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:20:38" (1/1) ... [2025-03-17 05:20:38,693 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:20:38" (1/1) ... [2025-03-17 05:20:38,696 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:20:38" (1/1) ... [2025-03-17 05:20:38,699 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:20:38" (1/1) ... [2025-03-17 05:20:38,704 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:20:38,705 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:20:38,705 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:20:38,705 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:20:38,706 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:20:38" (1/1) ... [2025-03-17 05:20:38,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:20:38,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:20:38,742 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:20:38,752 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:20:38,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:20:38,769 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-17 05:20:38,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-17 05:20:38,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-03-17 05:20:38,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-03-17 05:20:38,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2025-03-17 05:20:38,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2025-03-17 05:20:38,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2025-03-17 05:20:38,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-17 05:20:38,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-17 05:20:38,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-03-17 05:20:38,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-03-17 05:20:38,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2025-03-17 05:20:38,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2025-03-17 05:20:38,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2025-03-17 05:20:38,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-17 05:20:38,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-17 05:20:38,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-17 05:20:38,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-17 05:20:38,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-03-17 05:20:38,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-03-17 05:20:38,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2025-03-17 05:20:38,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-03-17 05:20:38,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-03-17 05:20:38,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-03-17 05:20:38,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-03-17 05:20:38,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-03-17 05:20:38,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-03-17 05:20:38,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2025-03-17 05:20:38,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 05:20:38,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-17 05:20:38,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-17 05:20:38,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-17 05:20:38,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-17 05:20:38,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-03-17 05:20:38,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2025-03-17 05:20:38,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-17 05:20:38,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-17 05:20:38,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-03-17 05:20:38,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-03-17 05:20:38,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-03-17 05:20:38,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-03-17 05:20:38,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2025-03-17 05:20:38,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-17 05:20:38,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-17 05:20:38,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-03-17 05:20:38,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-03-17 05:20:38,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-03-17 05:20:38,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2025-03-17 05:20:38,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2025-03-17 05:20:38,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-03-17 05:20:38,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-03-17 05:20:38,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-03-17 05:20:38,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-03-17 05:20:38,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2025-03-17 05:20:38,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2025-03-17 05:20:38,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2025-03-17 05:20:38,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-17 05:20:38,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-17 05:20:38,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-17 05:20:38,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-03-17 05:20:38,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-03-17 05:20:38,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-03-17 05:20:38,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2025-03-17 05:20:38,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-17 05:20:38,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-17 05:20:38,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-03-17 05:20:38,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-03-17 05:20:38,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-03-17 05:20:38,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2025-03-17 05:20:38,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2025-03-17 05:20:38,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-17 05:20:38,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-17 05:20:38,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-03-17 05:20:38,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-03-17 05:20:38,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-03-17 05:20:38,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2025-03-17 05:20:38,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2025-03-17 05:20:38,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-03-17 05:20:38,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-03-17 05:20:38,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-03-17 05:20:38,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-03-17 05:20:38,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-03-17 05:20:38,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2025-03-17 05:20:38,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2025-03-17 05:20:38,778 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:20:38,778 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:20:38,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:20:38,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:20:38,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-17 05:20:38,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-17 05:20:38,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-17 05:20:38,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-17 05:20:38,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-17 05:20:38,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-03-17 05:20:38,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2025-03-17 05:20:38,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-17 05:20:38,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-17 05:20:38,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-03-17 05:20:38,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-03-17 05:20:38,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-03-17 05:20:38,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2025-03-17 05:20:38,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2025-03-17 05:20:38,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-17 05:20:38,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-17 05:20:38,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-17 05:20:38,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-03-17 05:20:38,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-03-17 05:20:38,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-03-17 05:20:38,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2025-03-17 05:20:38,947 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:20:38,949 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:20:43,640 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L107: havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~short106#1;havoc property_#t~ite109#1;havoc property_#t~mem108#1;havoc property_#t~mem107#1;havoc property_#t~ite115#1;havoc property_#t~mem111#1;havoc property_#t~mem110#1;havoc property_#t~mem114#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~short116#1;havoc property_#t~mem117#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~short120#1;havoc property_#t~mem121#1;havoc property_#t~short122#1;havoc property_#t~ite129#1;havoc property_#t~mem124#1;havoc property_#t~mem123#1;havoc property_#t~mem128#1;havoc property_#t~mem125#1;havoc property_#t~mem126#1;havoc property_#t~short127#1;havoc property_#t~short130#1;havoc property_#t~mem131#1;havoc property_#t~mem132#1;havoc property_#t~mem133#1;havoc property_#t~ite160#1;havoc property_#t~mem134#1;havoc property_#t~mem135#1;havoc property_#t~ite157#1;havoc property_#t~mem138#1;havoc property_#t~mem136#1;havoc property_#t~mem137#1;havoc property_#t~mem156#1;havoc property_#t~mem146#1;havoc property_#t~mem139#1;havoc property_#t~mem140#1;havoc property_#t~ite145#1;havoc property_#t~mem141#1;havoc property_#t~mem142#1;havoc property_#t~mem143#1;havoc property_#t~mem144#1;havoc property_#t~ite155#1;havoc property_#t~mem147#1;havoc property_#t~mem148#1;havoc property_#t~mem149#1;havoc property_#t~ite154#1;havoc property_#t~mem150#1;havoc property_#t~mem151#1;havoc property_#t~mem152#1;havoc property_#t~mem153#1;havoc property_#t~mem159#1;havoc property_#t~mem158#1;havoc property_#t~short161#1; [2025-03-17 05:20:43,670 INFO L? ?]: Removed 138 outVars from TransFormulas that were not future-live. [2025-03-17 05:20:43,670 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:20:43,678 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:20:43,679 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:20:43,679 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:20:43 BoogieIcfgContainer [2025-03-17 05:20:43,679 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:20:43,680 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:20:43,681 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:20:43,685 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:20:43,685 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:20:38" (1/3) ... [2025-03-17 05:20:43,686 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32b577e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:20:43, skipping insertion in model container [2025-03-17 05:20:43,686 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:20:38" (2/3) ... [2025-03-17 05:20:43,686 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32b577e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:20:43, skipping insertion in model container [2025-03-17 05:20:43,686 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:20:43" (3/3) ... [2025-03-17 05:20:43,687 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-14.i [2025-03-17 05:20:43,697 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:20:43,698 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-14.i that has 2 procedures, 122 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:20:43,732 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:20:43,740 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;@4e4a9679, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:20:43,740 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:20:43,743 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 98 states have (on average 1.4387755102040816) internal successors, (141), 99 states have internal predecessors, (141), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 05:20:43,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-17 05:20:43,756 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:43,757 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:43,758 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:43,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:43,762 INFO L85 PathProgramCache]: Analyzing trace with hash -557544856, now seen corresponding path program 1 times [2025-03-17 05:20:43,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:20:43,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1292824335] [2025-03-17 05:20:43,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:43,770 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:20:43,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:20:43,772 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:20:43,774 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:20:43,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-17 05:20:44,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-17 05:20:44,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:44,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:44,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:20:44,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:20:44,231 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 424 proven. 0 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2025-03-17 05:20:44,231 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:20:44,232 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:20:44,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1292824335] [2025-03-17 05:20:44,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1292824335] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:20:44,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:20:44,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 05:20:44,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627163074] [2025-03-17 05:20:44,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:20:44,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:20:44,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:20:44,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:20:44,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:20:44,255 INFO L87 Difference]: Start difference. First operand has 122 states, 98 states have (on average 1.4387755102040816) internal successors, (141), 99 states have internal predecessors, (141), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-17 05:20:44,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:44,284 INFO L93 Difference]: Finished difference Result 241 states and 385 transitions. [2025-03-17 05:20:44,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:20:44,286 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 164 [2025-03-17 05:20:44,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:44,290 INFO L225 Difference]: With dead ends: 241 [2025-03-17 05:20:44,290 INFO L226 Difference]: Without dead ends: 120 [2025-03-17 05:20:44,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 163 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:20:44,298 INFO L435 NwaCegarLoop]: 179 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, 179 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:20:44,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:20:44,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-17 05:20:44,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2025-03-17 05:20:44,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 97 states have (on average 1.4123711340206186) internal successors, (137), 97 states have internal predecessors, (137), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 05:20:44,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 179 transitions. [2025-03-17 05:20:44,330 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 179 transitions. Word has length 164 [2025-03-17 05:20:44,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:44,330 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 179 transitions. [2025-03-17 05:20:44,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-17 05:20:44,330 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 179 transitions. [2025-03-17 05:20:44,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-17 05:20:44,332 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:44,333 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:44,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-17 05:20:44,535 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:20:44,536 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:44,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:44,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1386601767, now seen corresponding path program 1 times [2025-03-17 05:20:44,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:20:44,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [4937051] [2025-03-17 05:20:44,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:44,537 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:20:44,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:20:44,541 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:20:44,541 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:20:44,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-17 05:20:44,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-17 05:20:44,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:44,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:44,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:20:44,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:20:44,978 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 416 proven. 0 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2025-03-17 05:20:44,989 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:20:44,990 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:20:44,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [4937051] [2025-03-17 05:20:44,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [4937051] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:20:44,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:20:44,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:20:44,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593846220] [2025-03-17 05:20:44,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:20:45,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:20:45,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:20:45,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:20:45,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:20:45,008 INFO L87 Difference]: Start difference. First operand 120 states and 179 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-17 05:20:45,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:45,167 INFO L93 Difference]: Finished difference Result 241 states and 360 transitions. [2025-03-17 05:20:45,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:20:45,184 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 164 [2025-03-17 05:20:45,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:45,185 INFO L225 Difference]: With dead ends: 241 [2025-03-17 05:20:45,185 INFO L226 Difference]: Without dead ends: 122 [2025-03-17 05:20:45,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 161 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:20:45,186 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 0 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:20:45,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 520 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:20:45,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-17 05:20:45,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2025-03-17 05:20:45,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 99 states have (on average 1.404040404040404) internal successors, (139), 99 states have internal predecessors, (139), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 05:20:45,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 181 transitions. [2025-03-17 05:20:45,198 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 181 transitions. Word has length 164 [2025-03-17 05:20:45,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:45,202 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 181 transitions. [2025-03-17 05:20:45,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-17 05:20:45,203 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 181 transitions. [2025-03-17 05:20:45,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-17 05:20:45,204 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:45,204 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:45,220 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-17 05:20:45,406 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:20:45,407 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:45,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:45,408 INFO L85 PathProgramCache]: Analyzing trace with hash -240061254, now seen corresponding path program 1 times [2025-03-17 05:20:45,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:20:45,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [40903225] [2025-03-17 05:20:45,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:45,409 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:20:45,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:20:45,411 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:20:45,412 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:20:45,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-17 05:20:45,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-17 05:20:45,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:45,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:45,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:20:45,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:20:45,788 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 432 proven. 0 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2025-03-17 05:20:45,788 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:20:45,788 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:20:45,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [40903225] [2025-03-17 05:20:45,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [40903225] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:20:45,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:20:45,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:20:45,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419908057] [2025-03-17 05:20:45,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:20:45,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:20:45,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:20:45,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:20:45,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:20:45,790 INFO L87 Difference]: Start difference. First operand 122 states and 181 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-17 05:20:45,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:45,844 INFO L93 Difference]: Finished difference Result 245 states and 364 transitions. [2025-03-17 05:20:45,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:20:45,845 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 164 [2025-03-17 05:20:45,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:45,846 INFO L225 Difference]: With dead ends: 245 [2025-03-17 05:20:45,847 INFO L226 Difference]: Without dead ends: 124 [2025-03-17 05:20:45,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 161 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:20:45,848 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 0 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 520 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:20:45,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 520 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:20:45,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-03-17 05:20:45,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2025-03-17 05:20:45,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 101 states have (on average 1.396039603960396) internal successors, (141), 101 states have internal predecessors, (141), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 05:20:45,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 183 transitions. [2025-03-17 05:20:45,857 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 183 transitions. Word has length 164 [2025-03-17 05:20:45,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:45,858 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 183 transitions. [2025-03-17 05:20:45,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-17 05:20:45,858 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 183 transitions. [2025-03-17 05:20:45,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-17 05:20:45,863 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:45,863 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:45,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-17 05:20:46,064 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:20:46,065 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:46,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:46,066 INFO L85 PathProgramCache]: Analyzing trace with hash 288857785, now seen corresponding path program 1 times [2025-03-17 05:20:46,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:20:46,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1564937982] [2025-03-17 05:20:46,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:46,066 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:20:46,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:20:46,068 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:20:46,070 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:20:46,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-17 05:20:46,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-17 05:20:46,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:46,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:46,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:20:46,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:20:46,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-17 05:20:46,838 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-17 05:20:46,838 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:20:46,838 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:20:46,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1564937982] [2025-03-17 05:20:46,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1564937982] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:20:46,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:20:46,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 05:20:46,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438528826] [2025-03-17 05:20:46,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:20:46,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:20:46,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:20:46,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:20:46,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:20:46,839 INFO L87 Difference]: Start difference. First operand 124 states and 183 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 05:20:47,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:47,081 INFO L93 Difference]: Finished difference Result 386 states and 572 transitions. [2025-03-17 05:20:47,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:20:47,082 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 164 [2025-03-17 05:20:47,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:47,084 INFO L225 Difference]: With dead ends: 386 [2025-03-17 05:20:47,084 INFO L226 Difference]: Without dead ends: 263 [2025-03-17 05:20:47,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:20:47,085 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 197 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:20:47,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 508 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:20:47,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-03-17 05:20:47,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 220. [2025-03-17 05:20:47,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 175 states have (on average 1.3771428571428572) internal successors, (241), 175 states have internal predecessors, (241), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-17 05:20:47,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 325 transitions. [2025-03-17 05:20:47,115 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 325 transitions. Word has length 164 [2025-03-17 05:20:47,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:47,115 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 325 transitions. [2025-03-17 05:20:47,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 05:20:47,116 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 325 transitions. [2025-03-17 05:20:47,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-17 05:20:47,117 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:47,117 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:47,128 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:20:47,320 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:20:47,320 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:47,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:47,320 INFO L85 PathProgramCache]: Analyzing trace with hash 221851032, now seen corresponding path program 1 times [2025-03-17 05:20:47,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:20:47,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [409836973] [2025-03-17 05:20:47,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:47,321 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:20:47,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:20:47,323 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:20:47,323 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:20:47,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-17 05:20:47,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-17 05:20:47,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:47,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:47,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 05:20:47,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:20:47,694 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 19 treesize of output 15 [2025-03-17 05:20:47,744 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-17 05:20:47,745 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:20:47,745 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:20:47,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [409836973] [2025-03-17 05:20:47,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [409836973] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:20:47,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:20:47,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:20:47,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518143278] [2025-03-17 05:20:47,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:20:47,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:20:47,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:20:47,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:20:47,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:20:47,747 INFO L87 Difference]: Start difference. First operand 220 states and 325 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 05:20:52,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:52,093 INFO L93 Difference]: Finished difference Result 482 states and 713 transitions. [2025-03-17 05:20:52,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:20:52,094 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 164 [2025-03-17 05:20:52,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:52,096 INFO L225 Difference]: With dead ends: 482 [2025-03-17 05:20:52,096 INFO L226 Difference]: Without dead ends: 335 [2025-03-17 05:20:52,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:20:52,097 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 141 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:20:52,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 1013 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-03-17 05:20:52,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2025-03-17 05:20:52,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 230. [2025-03-17 05:20:52,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 185 states have (on average 1.3783783783783783) internal successors, (255), 185 states have internal predecessors, (255), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-17 05:20:52,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 339 transitions. [2025-03-17 05:20:52,114 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 339 transitions. Word has length 164 [2025-03-17 05:20:52,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:52,114 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 339 transitions. [2025-03-17 05:20:52,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 05:20:52,115 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 339 transitions. [2025-03-17 05:20:52,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-17 05:20:52,116 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:52,116 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:52,127 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:20:52,317 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:20:52,317 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:52,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:52,318 INFO L85 PathProgramCache]: Analyzing trace with hash -283707593, now seen corresponding path program 1 times [2025-03-17 05:20:52,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:20:52,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [219431542] [2025-03-17 05:20:52,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:52,318 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:20:52,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:20:52,322 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:20:52,323 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:20:52,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-17 05:20:52,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-17 05:20:52,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:52,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:52,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 05:20:52,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:20:52,738 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-17 05:20:52,738 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:20:52,738 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:20:52,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [219431542] [2025-03-17 05:20:52,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [219431542] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:20:52,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:20:52,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:20:52,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222491417] [2025-03-17 05:20:52,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:20:52,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:20:52,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:20:52,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:20:52,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:20:52,741 INFO L87 Difference]: Start difference. First operand 230 states and 339 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 05:20:52,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:52,854 INFO L93 Difference]: Finished difference Result 389 states and 577 transitions. [2025-03-17 05:20:52,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:20:52,855 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 164 [2025-03-17 05:20:52,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:52,856 INFO L225 Difference]: With dead ends: 389 [2025-03-17 05:20:52,856 INFO L226 Difference]: Without dead ends: 232 [2025-03-17 05:20:52,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:20:52,857 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 1 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:20:52,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 498 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:20:52,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-03-17 05:20:52,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2025-03-17 05:20:52,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 187 states have (on average 1.374331550802139) internal successors, (257), 187 states have internal predecessors, (257), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-17 05:20:52,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 341 transitions. [2025-03-17 05:20:52,872 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 341 transitions. Word has length 164 [2025-03-17 05:20:52,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:52,873 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 341 transitions. [2025-03-17 05:20:52,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 05:20:52,873 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 341 transitions. [2025-03-17 05:20:52,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-17 05:20:52,875 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:52,875 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:52,884 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:20:53,075 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:20:53,076 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:53,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:53,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1223844216, now seen corresponding path program 1 times [2025-03-17 05:20:53,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:20:53,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [325558067] [2025-03-17 05:20:53,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:53,077 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:20:53,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:20:53,081 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:20:53,081 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:20:53,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-17 05:20:53,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-17 05:20:53,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:53,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:53,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 05:20:53,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:20:53,566 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-17 05:20:53,567 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:20:53,567 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:20:53,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [325558067] [2025-03-17 05:20:53,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [325558067] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:20:53,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:20:53,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:20:53,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735847954] [2025-03-17 05:20:53,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:20:53,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:20:53,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:20:53,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:20:53,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:20:53,569 INFO L87 Difference]: Start difference. First operand 232 states and 341 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 05:20:53,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:53,926 INFO L93 Difference]: Finished difference Result 524 states and 773 transitions. [2025-03-17 05:20:53,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:20:53,927 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 164 [2025-03-17 05:20:53,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:53,929 INFO L225 Difference]: With dead ends: 524 [2025-03-17 05:20:53,929 INFO L226 Difference]: Without dead ends: 365 [2025-03-17 05:20:53,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 160 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:20:53,934 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 164 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:20:53,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 684 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:20:53,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2025-03-17 05:20:53,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 228. [2025-03-17 05:20:53,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 183 states have (on average 1.3387978142076502) internal successors, (245), 183 states have internal predecessors, (245), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-17 05:20:53,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 329 transitions. [2025-03-17 05:20:53,946 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 329 transitions. Word has length 164 [2025-03-17 05:20:53,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:53,946 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 329 transitions. [2025-03-17 05:20:53,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 05:20:53,947 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 329 transitions. [2025-03-17 05:20:53,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-17 05:20:53,948 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:53,948 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:53,957 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:20:54,149 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:20:54,149 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:54,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:54,149 INFO L85 PathProgramCache]: Analyzing trace with hash -987968715, now seen corresponding path program 1 times [2025-03-17 05:20:54,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:20:54,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1751320633] [2025-03-17 05:20:54,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:54,150 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:20:54,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:20:54,152 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:20:54,152 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:20:54,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-17 05:20:54,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-17 05:20:54,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:54,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:54,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 05:20:54,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:20:54,713 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:20:54,713 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:20:54,761 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 416 proven. 0 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2025-03-17 05:20:54,761 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:20:54,761 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:20:54,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1751320633] [2025-03-17 05:20:54,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1751320633] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:20:54,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:20:54,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:20:54,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290702131] [2025-03-17 05:20:54,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:20:54,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:20:54,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:20:54,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:20:54,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:20:54,763 INFO L87 Difference]: Start difference. First operand 228 states and 329 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-17 05:20:59,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:21:00,360 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:21:01,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:21:01,460 INFO L93 Difference]: Finished difference Result 431 states and 622 transitions. [2025-03-17 05:21:01,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:21:01,471 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 166 [2025-03-17 05:21:01,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:21:01,473 INFO L225 Difference]: With dead ends: 431 [2025-03-17 05:21:01,473 INFO L226 Difference]: Without dead ends: 228 [2025-03-17 05:21:01,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 161 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:21:01,475 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 149 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2025-03-17 05:21:01,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 554 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2025-03-17 05:21:01,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-03-17 05:21:01,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 224. [2025-03-17 05:21:01,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 179 states have (on average 1.335195530726257) internal successors, (239), 179 states have internal predecessors, (239), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-17 05:21:01,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 323 transitions. [2025-03-17 05:21:01,484 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 323 transitions. Word has length 166 [2025-03-17 05:21:01,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:21:01,484 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 323 transitions. [2025-03-17 05:21:01,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-17 05:21:01,484 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 323 transitions. [2025-03-17 05:21:01,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-17 05:21:01,485 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:21:01,485 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:01,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2025-03-17 05:21:01,685 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:21:01,686 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:21:01,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:21:01,686 INFO L85 PathProgramCache]: Analyzing trace with hash 5345686, now seen corresponding path program 1 times [2025-03-17 05:21:01,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:21:01,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1146488714] [2025-03-17 05:21:01,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:21:01,687 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:21:01,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:21:01,688 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:21:01,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2025-03-17 05:21:01,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-17 05:21:02,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-17 05:21:02,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:21:02,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:21:02,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 05:21:02,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:21:02,393 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:21:02,393 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 154 treesize of output 64 [2025-03-17 05:21:02,519 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 432 proven. 32 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2025-03-17 05:21:02,519 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:21:03,015 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:21:03,016 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 98 treesize of output 1 [2025-03-17 05:21:03,079 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 24 proven. 36 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-03-17 05:21:03,079 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:21:03,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1146488714] [2025-03-17 05:21:03,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1146488714] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:21:03,080 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:21:03,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2025-03-17 05:21:03,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813394270] [2025-03-17 05:21:03,080 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 05:21:03,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 05:21:03,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:21:03,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 05:21:03,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:21:03,081 INFO L87 Difference]: Start difference. First operand 224 states and 323 transitions. Second operand has 12 states, 11 states have (on average 8.272727272727273) internal successors, (91), 12 states have internal predecessors, (91), 4 states have call successors, (41), 3 states have call predecessors, (41), 4 states have return successors, (41), 3 states have call predecessors, (41), 4 states have call successors, (41) [2025-03-17 05:21:06,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:21:08,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:21:11,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:21:11,367 INFO L93 Difference]: Finished difference Result 450 states and 641 transitions. [2025-03-17 05:21:11,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 05:21:11,384 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.272727272727273) internal successors, (91), 12 states have internal predecessors, (91), 4 states have call successors, (41), 3 states have call predecessors, (41), 4 states have return successors, (41), 3 states have call predecessors, (41), 4 states have call successors, (41) Word has length 168 [2025-03-17 05:21:11,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:21:11,395 INFO L225 Difference]: With dead ends: 450 [2025-03-17 05:21:11,396 INFO L226 Difference]: Without dead ends: 228 [2025-03-17 05:21:11,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2025-03-17 05:21:11,397 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 145 mSDsluCounter, 891 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 1021 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:21:11,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 1021 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 8.0s Time] [2025-03-17 05:21:11,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-03-17 05:21:11,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 224. [2025-03-17 05:21:11,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 179 states have (on average 1.312849162011173) internal successors, (235), 179 states have internal predecessors, (235), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-17 05:21:11,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 319 transitions. [2025-03-17 05:21:11,417 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 319 transitions. Word has length 168 [2025-03-17 05:21:11,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:21:11,417 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 319 transitions. [2025-03-17 05:21:11,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.272727272727273) internal successors, (91), 12 states have internal predecessors, (91), 4 states have call successors, (41), 3 states have call predecessors, (41), 4 states have return successors, (41), 3 states have call predecessors, (41), 4 states have call successors, (41) [2025-03-17 05:21:11,417 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 319 transitions. [2025-03-17 05:21:11,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-17 05:21:11,418 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:21:11,418 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:11,429 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:21:11,619 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:21:11,620 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:21:11,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:21:11,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1220900105, now seen corresponding path program 1 times [2025-03-17 05:21:11,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:21:11,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1584382995] [2025-03-17 05:21:11,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:21:11,621 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:21:11,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:21:11,623 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:21:11,624 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:21:11,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-17 05:21:12,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-17 05:21:12,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:21:12,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:21:12,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 05:21:12,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:21:12,124 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:21:12,350 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 42 treesize of output 20 [2025-03-17 05:21:12,447 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 42 treesize of output 20 [2025-03-17 05:21:12,548 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 37 treesize of output 30 [2025-03-17 05:21:14,173 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 87 treesize of output 65 [2025-03-17 05:21:14,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:21:14,183 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:21:14,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 85 [2025-03-17 05:21:14,275 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:21:14,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 34 [2025-03-17 05:21:14,309 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 282 proven. 114 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2025-03-17 05:21:14,309 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:21:14,771 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 726 trivial. 0 not checked. [2025-03-17 05:21:14,771 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:21:14,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1584382995] [2025-03-17 05:21:14,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1584382995] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:21:14,771 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:21:14,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 18 [2025-03-17 05:21:14,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122735454] [2025-03-17 05:21:14,771 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 05:21:14,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 05:21:14,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:21:14,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 05:21:14,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2025-03-17 05:21:14,773 INFO L87 Difference]: Start difference. First operand 224 states and 319 transitions. Second operand has 18 states, 14 states have (on average 9.0) internal successors, (126), 18 states have internal predecessors, (126), 7 states have call successors, (42), 4 states have call predecessors, (42), 6 states have return successors, (42), 3 states have call predecessors, (42), 7 states have call successors, (42) [2025-03-17 05:21:16,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:21:16,425 INFO L93 Difference]: Finished difference Result 570 states and 784 transitions. [2025-03-17 05:21:16,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-03-17 05:21:16,425 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 9.0) internal successors, (126), 18 states have internal predecessors, (126), 7 states have call successors, (42), 4 states have call predecessors, (42), 6 states have return successors, (42), 3 states have call predecessors, (42), 7 states have call successors, (42) Word has length 168 [2025-03-17 05:21:16,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:21:16,427 INFO L225 Difference]: With dead ends: 570 [2025-03-17 05:21:16,427 INFO L226 Difference]: Without dead ends: 417 [2025-03-17 05:21:16,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 319 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=434, Invalid=1546, Unknown=0, NotChecked=0, Total=1980 [2025-03-17 05:21:16,428 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 291 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 922 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 05:21:16,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 922 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 05:21:16,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2025-03-17 05:21:16,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 252. [2025-03-17 05:21:16,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 201 states have (on average 1.2786069651741294) internal successors, (257), 201 states have internal predecessors, (257), 42 states have call successors, (42), 8 states have call predecessors, (42), 8 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-17 05:21:16,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 341 transitions. [2025-03-17 05:21:16,449 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 341 transitions. Word has length 168 [2025-03-17 05:21:16,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:21:16,449 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 341 transitions. [2025-03-17 05:21:16,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 9.0) internal successors, (126), 18 states have internal predecessors, (126), 7 states have call successors, (42), 4 states have call predecessors, (42), 6 states have return successors, (42), 3 states have call predecessors, (42), 7 states have call successors, (42) [2025-03-17 05:21:16,449 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 341 transitions. [2025-03-17 05:21:16,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-17 05:21:16,450 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:21:16,450 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:16,462 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:21:16,651 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:21:16,651 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:21:16,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:21:16,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1177086217, now seen corresponding path program 1 times [2025-03-17 05:21:16,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:21:16,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [745119284] [2025-03-17 05:21:16,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:21:16,652 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:21:16,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:21:16,654 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:21:16,654 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:21:16,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-17 05:21:17,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-17 05:21:17,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:21:17,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:21:17,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-17 05:21:17,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:21:17,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-03-17 05:21:17,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2025-03-17 05:21:17,844 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:21:17,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 64 treesize of output 50 [2025-03-17 05:21:18,558 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:21:18,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 67 [2025-03-17 05:21:18,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-03-17 05:21:18,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 43 [2025-03-17 05:21:19,704 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:21:19,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 168 treesize of output 86 [2025-03-17 05:21:19,851 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 465 proven. 39 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2025-03-17 05:21:19,851 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:21:20,679 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-17 05:21:20,679 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:21:20,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [745119284] [2025-03-17 05:21:20,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [745119284] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:21:20,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:21:20,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [24] total 29 [2025-03-17 05:21:20,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247745155] [2025-03-17 05:21:20,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:21:20,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:21:20,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:21:20,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:21:20,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=665, Unknown=0, NotChecked=0, Total=812 [2025-03-17 05:21:20,681 INFO L87 Difference]: Start difference. First operand 252 states and 341 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 05:21:25,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:21:30,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:21:30,135 INFO L93 Difference]: Finished difference Result 518 states and 698 transitions. [2025-03-17 05:21:30,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:21:30,136 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2025-03-17 05:21:30,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:21:30,138 INFO L225 Difference]: With dead ends: 518 [2025-03-17 05:21:30,138 INFO L226 Difference]: Without dead ends: 349 [2025-03-17 05:21:30,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=180, Invalid=876, Unknown=0, NotChecked=0, Total=1056 [2025-03-17 05:21:30,139 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 451 mSDsluCounter, 1035 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 1255 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:21:30,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 1255 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 9.2s Time] [2025-03-17 05:21:30,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2025-03-17 05:21:30,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 345. [2025-03-17 05:21:30,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 276 states have (on average 1.2753623188405796) internal successors, (352), 277 states have internal predecessors, (352), 55 states have call successors, (55), 13 states have call predecessors, (55), 13 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2025-03-17 05:21:30,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 462 transitions. [2025-03-17 05:21:30,246 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 462 transitions. Word has length 168 [2025-03-17 05:21:30,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:21:30,247 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 462 transitions. [2025-03-17 05:21:30,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 05:21:30,247 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 462 transitions. [2025-03-17 05:21:30,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-17 05:21:30,248 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:21:30,248 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:30,293 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:21:30,448 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:21:30,449 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:21:30,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:21:30,454 INFO L85 PathProgramCache]: Analyzing trace with hash 370225701, now seen corresponding path program 1 times [2025-03-17 05:21:30,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:21:30,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1893454522] [2025-03-17 05:21:30,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:21:30,455 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:21:30,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:21:30,464 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:21:30,473 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:21:30,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-17 05:21:30,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-17 05:21:30,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:21:30,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:21:30,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 05:21:30,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:21:30,988 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 19 treesize of output 1 [2025-03-17 05:21:31,182 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 42 treesize of output 20 [2025-03-17 05:21:31,292 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 42 treesize of output 20 [2025-03-17 05:21:31,426 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 42 treesize of output 20 [2025-03-17 05:21:32,219 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 77 treesize of output 57 [2025-03-17 05:21:32,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:21:32,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 67 [2025-03-17 05:21:32,466 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:21:32,466 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 165 treesize of output 97 [2025-03-17 05:21:32,526 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 42 proven. 114 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:21:32,526 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:21:33,008 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-17 05:21:33,009 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:21:33,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1893454522] [2025-03-17 05:21:33,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1893454522] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:21:33,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:21:33,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 16 [2025-03-17 05:21:33,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592748615] [2025-03-17 05:21:33,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:21:33,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:21:33,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:21:33,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:21:33,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2025-03-17 05:21:33,010 INFO L87 Difference]: Start difference. First operand 345 states and 462 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 05:21:33,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:21:33,220 INFO L93 Difference]: Finished difference Result 677 states and 911 transitions. [2025-03-17 05:21:33,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:21:33,221 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 173 [2025-03-17 05:21:33,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:21:33,223 INFO L225 Difference]: With dead ends: 677 [2025-03-17 05:21:33,223 INFO L226 Difference]: Without dead ends: 419 [2025-03-17 05:21:33,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2025-03-17 05:21:33,224 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 36 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:21:33,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 816 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:21:33,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2025-03-17 05:21:33,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 379. [2025-03-17 05:21:33,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 310 states have (on average 1.270967741935484) internal successors, (394), 311 states have internal predecessors, (394), 55 states have call successors, (55), 13 states have call predecessors, (55), 13 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2025-03-17 05:21:33,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 504 transitions. [2025-03-17 05:21:33,246 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 504 transitions. Word has length 173 [2025-03-17 05:21:33,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:21:33,247 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 504 transitions. [2025-03-17 05:21:33,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 05:21:33,247 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 504 transitions. [2025-03-17 05:21:33,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-17 05:21:33,248 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:21:33,248 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:33,259 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 (13)] Ended with exit code 0 [2025-03-17 05:21:33,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:21:33,449 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:21:33,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:21:33,450 INFO L85 PathProgramCache]: Analyzing trace with hash 882148963, now seen corresponding path program 1 times [2025-03-17 05:21:33,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:21:33,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1272085398] [2025-03-17 05:21:33,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:21:33,450 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:21:33,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:21:33,452 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:21:33,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2025-03-17 05:21:33,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-17 05:21:33,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-17 05:21:33,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:21:33,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:21:33,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 05:21:33,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:21:33,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-03-17 05:21:33,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2025-03-17 05:21:33,873 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-17 05:21:33,873 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:21:33,874 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:21:33,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1272085398] [2025-03-17 05:21:33,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1272085398] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:21:33,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:21:33,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:21:33,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300133782] [2025-03-17 05:21:33,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:21:33,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:21:33,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:21:33,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:21:33,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:21:33,875 INFO L87 Difference]: Start difference. First operand 379 states and 504 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 05:21:34,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:21:34,056 INFO L93 Difference]: Finished difference Result 921 states and 1234 transitions. [2025-03-17 05:21:34,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:21:34,057 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 175 [2025-03-17 05:21:34,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:21:34,058 INFO L225 Difference]: With dead ends: 921 [2025-03-17 05:21:34,058 INFO L226 Difference]: Without dead ends: 629 [2025-03-17 05:21:34,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 171 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:21:34,059 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 164 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:21:34,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 717 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:21:34,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2025-03-17 05:21:34,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 385. [2025-03-17 05:21:34,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 316 states have (on average 1.2658227848101267) internal successors, (400), 317 states have internal predecessors, (400), 55 states have call successors, (55), 13 states have call predecessors, (55), 13 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2025-03-17 05:21:34,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 510 transitions. [2025-03-17 05:21:34,081 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 510 transitions. Word has length 175 [2025-03-17 05:21:34,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:21:34,081 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 510 transitions. [2025-03-17 05:21:34,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 05:21:34,081 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 510 transitions. [2025-03-17 05:21:34,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-17 05:21:34,083 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:21:34,083 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:34,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2025-03-17 05:21:34,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:21:34,284 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:21:34,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:21:34,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1508866659, now seen corresponding path program 1 times [2025-03-17 05:21:34,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:21:34,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1598547200] [2025-03-17 05:21:34,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:21:34,285 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:21:34,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:21:34,288 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:21:34,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2025-03-17 05:21:34,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-17 05:21:34,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-17 05:21:34,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:21:34,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:21:34,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 05:21:34,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:21:34,914 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:21:34,964 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 31 treesize of output 15 [2025-03-17 05:21:35,495 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 47 treesize of output 33 [2025-03-17 05:21:35,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:21:35,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 55 [2025-03-17 05:21:35,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 4 [2025-03-17 05:21:35,873 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:21:35,875 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 67 treesize of output 35 [2025-03-17 05:21:35,897 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 330 proven. 45 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-03-17 05:21:35,897 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:21:36,103 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-17 05:21:36,103 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:21:36,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1598547200] [2025-03-17 05:21:36,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1598547200] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:21:36,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:21:36,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2025-03-17 05:21:36,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774351496] [2025-03-17 05:21:36,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:21:36,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:21:36,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:21:36,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:21:36,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:21:36,105 INFO L87 Difference]: Start difference. First operand 385 states and 510 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 05:21:36,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:21:36,305 INFO L93 Difference]: Finished difference Result 819 states and 1083 transitions. [2025-03-17 05:21:36,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:21:36,305 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 175 [2025-03-17 05:21:36,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:21:36,308 INFO L225 Difference]: With dead ends: 819 [2025-03-17 05:21:36,308 INFO L226 Difference]: Without dead ends: 521 [2025-03-17 05:21:36,308 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:21:36,309 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 51 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:21:36,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 729 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:21:36,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2025-03-17 05:21:36,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 515. [2025-03-17 05:21:36,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 432 states have (on average 1.2685185185185186) internal successors, (548), 435 states have internal predecessors, (548), 63 states have call successors, (63), 19 states have call predecessors, (63), 19 states have return successors, (63), 60 states have call predecessors, (63), 63 states have call successors, (63) [2025-03-17 05:21:36,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 674 transitions. [2025-03-17 05:21:36,333 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 674 transitions. Word has length 175 [2025-03-17 05:21:36,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:21:36,333 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 674 transitions. [2025-03-17 05:21:36,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 05:21:36,333 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 674 transitions. [2025-03-17 05:21:36,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-17 05:21:36,334 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:21:36,334 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:36,345 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 (15)] Ended with exit code 0