./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-78.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-78.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 99d92429afe7a1d3dd5b770cdd3a3c403da1aa6e04070cb3749a858d645383e6 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:20:42,833 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:20:42,933 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 11:20:42,939 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:20:42,939 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:20:42,963 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:20:42,964 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:20:42,964 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:20:42,965 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:20:42,965 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:20:42,966 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:20:42,966 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:20:42,967 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:20:42,967 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:20:42,967 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:20:42,968 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:20:42,968 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:20:42,968 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:20:42,969 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 11:20:42,969 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:20:42,969 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:20:42,972 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:20:42,972 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:20:42,973 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:20:42,973 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:20:42,977 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:20:42,977 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:20:42,978 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:20:42,978 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:20:42,978 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:20:42,978 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:20:42,978 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:20:42,979 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:20:42,979 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:20:42,979 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:20:42,980 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:20:42,980 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 11:20:42,980 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 11:20:42,980 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:20:42,980 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:20:42,981 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:20:42,982 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:20:42,982 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 99d92429afe7a1d3dd5b770cdd3a3c403da1aa6e04070cb3749a858d645383e6 [2024-10-24 11:20:43,227 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:20:43,250 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:20:43,253 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:20:43,254 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:20:43,254 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:20:43,255 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-78.i [2024-10-24 11:20:44,746 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:20:44,952 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:20:44,953 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-78.i [2024-10-24 11:20:44,965 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68672a015/d2c8240162bc4e3cb7a0659302631357/FLAG0c035d835 [2024-10-24 11:20:45,315 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68672a015/d2c8240162bc4e3cb7a0659302631357 [2024-10-24 11:20:45,318 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:20:45,319 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:20:45,320 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:20:45,321 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:20:45,326 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:20:45,327 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:20:45" (1/1) ... [2024-10-24 11:20:45,328 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69bf98c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:20:45, skipping insertion in model container [2024-10-24 11:20:45,329 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:20:45" (1/1) ... [2024-10-24 11:20:45,357 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:20:45,549 WARN L248 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-78.i[916,929] [2024-10-24 11:20:45,643 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:20:45,655 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:20:45,665 WARN L248 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-78.i[916,929] [2024-10-24 11:20:45,693 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:20:45,710 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:20:45,710 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:20:45 WrapperNode [2024-10-24 11:20:45,710 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:20:45,711 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:20:45,712 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:20:45,712 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:20:45,717 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:20:45" (1/1) ... [2024-10-24 11:20:45,730 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:20:45" (1/1) ... [2024-10-24 11:20:45,760 INFO L138 Inliner]: procedures = 29, calls = 136, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 419 [2024-10-24 11:20:45,761 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:20:45,766 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:20:45,766 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:20:45,766 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:20:45,779 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:20:45" (1/1) ... [2024-10-24 11:20:45,783 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:20:45" (1/1) ... [2024-10-24 11:20:45,790 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:20:45" (1/1) ... [2024-10-24 11:20:45,810 INFO L175 MemorySlicer]: Split 110 memory accesses to 6 slices as follows [2, 16, 21, 39, 9, 23]. 35 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 2, 3, 3, 1, 2]. The 15 writes are split as follows [0, 2, 4, 5, 2, 2]. [2024-10-24 11:20:45,810 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:20:45" (1/1) ... [2024-10-24 11:20:45,810 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:20:45" (1/1) ... [2024-10-24 11:20:45,831 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:20:45" (1/1) ... [2024-10-24 11:20:45,836 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:20:45" (1/1) ... [2024-10-24 11:20:45,843 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:20:45" (1/1) ... [2024-10-24 11:20:45,845 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:20:45" (1/1) ... [2024-10-24 11:20:45,856 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:20:45,857 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:20:45,857 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:20:45,857 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:20:45,858 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:20:45" (1/1) ... [2024-10-24 11:20:45,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:20:45,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:20:45,892 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) [2024-10-24 11:20:45,899 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 [2024-10-24 11:20:45,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:20:45,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 11:20:45,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 11:20:45,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-24 11:20:45,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-24 11:20:45,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-24 11:20:45,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-24 11:20:45,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-24 11:20:45,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-24 11:20:45,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-24 11:20:45,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-24 11:20:45,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-24 11:20:45,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-10-24 11:20:45,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-24 11:20:45,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-24 11:20:45,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-24 11:20:45,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-24 11:20:45,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-24 11:20:45,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-10-24 11:20:45,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 11:20:45,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 11:20:45,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-24 11:20:45,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-24 11:20:45,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-24 11:20:45,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-24 11:20:45,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-24 11:20:45,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-24 11:20:45,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-24 11:20:45,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-24 11:20:45,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-24 11:20:45,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-10-24 11:20:45,952 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:20:45,952 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:20:45,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 11:20:45,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 11:20:45,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-24 11:20:45,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-24 11:20:45,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-24 11:20:45,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-24 11:20:45,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:20:45,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:20:46,084 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:20:46,085 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:20:46,467 INFO L? ?]: Removed 102 outVars from TransFormulas that were not future-live. [2024-10-24 11:20:46,467 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:20:46,499 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:20:46,499 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:20:46,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:20:46 BoogieIcfgContainer [2024-10-24 11:20:46,500 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:20:46,503 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:20:46,503 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:20:46,506 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:20:46,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:20:45" (1/3) ... [2024-10-24 11:20:46,507 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c96b133 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:20:46, skipping insertion in model container [2024-10-24 11:20:46,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:20:45" (2/3) ... [2024-10-24 11:20:46,508 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c96b133 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:20:46, skipping insertion in model container [2024-10-24 11:20:46,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:20:46" (3/3) ... [2024-10-24 11:20:46,510 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-78.i [2024-10-24 11:20:46,526 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:20:46,527 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:20:46,597 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:20:46,603 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;@2133eaf3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:20:46,604 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:20:46,610 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 73 states have (on average 1.4931506849315068) internal successors, (109), 74 states have internal predecessors, (109), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-24 11:20:46,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-24 11:20:46,622 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:20:46,623 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:20:46,624 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:20:46,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:20:46,630 INFO L85 PathProgramCache]: Analyzing trace with hash -840123795, now seen corresponding path program 1 times [2024-10-24 11:20:46,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:20:46,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600144555] [2024-10-24 11:20:46,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:20:46,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:20:46,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:20:46,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:20:46,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:20:46,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:20:46,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:20:46,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:20:46,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:20:46,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:20:46,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:20:46,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:20:47,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:20:47,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:20:47,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:20:47,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:20:47,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:20:47,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:20:47,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:20:47,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:20:47,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:20:47,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:20:47,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:20:47,043 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-24 11:20:47,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:20:47,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600144555] [2024-10-24 11:20:47,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600144555] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:20:47,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:20:47,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:20:47,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975268182] [2024-10-24 11:20:47,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:20:47,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:20:47,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:20:47,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:20:47,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:20:47,082 INFO L87 Difference]: Start difference. First operand has 86 states, 73 states have (on average 1.4931506849315068) internal successors, (109), 74 states have internal predecessors, (109), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 11:20:47,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:20:47,130 INFO L93 Difference]: Finished difference Result 169 states and 266 transitions. [2024-10-24 11:20:47,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:20:47,133 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 93 [2024-10-24 11:20:47,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:20:47,141 INFO L225 Difference]: With dead ends: 169 [2024-10-24 11:20:47,141 INFO L226 Difference]: Without dead ends: 84 [2024-10-24 11:20:47,146 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:20:47,150 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:20:47,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:20:47,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-24 11:20:47,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-24 11:20:47,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 72 states have (on average 1.4444444444444444) internal successors, (104), 72 states have internal predecessors, (104), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-24 11:20:47,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 124 transitions. [2024-10-24 11:20:47,199 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 124 transitions. Word has length 93 [2024-10-24 11:20:47,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:20:47,200 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 124 transitions. [2024-10-24 11:20:47,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 11:20:47,200 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 124 transitions. [2024-10-24 11:20:47,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-24 11:20:47,206 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:20:47,207 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:20:47,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 11:20:47,207 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:20:47,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:20:47,208 INFO L85 PathProgramCache]: Analyzing trace with hash 879225721, now seen corresponding path program 1 times [2024-10-24 11:20:47,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:20:47,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300848147] [2024-10-24 11:20:47,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:20:47,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:20:47,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:20:47,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:20:47,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:20:47,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:20:47,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:20:47,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:20:47,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:20:47,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:20:47,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:20:47,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:20:47,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:20:47,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:20:47,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:20:47,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:20:47,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:20:47,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:20:47,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:20:47,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:20:47,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:20:47,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:20:47,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:20:47,481 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-24 11:20:47,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:20:47,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300848147] [2024-10-24 11:20:47,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300848147] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:20:47,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:20:47,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:20:47,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132350999] [2024-10-24 11:20:47,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:20:47,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:20:47,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:20:47,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:20:47,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:20:47,485 INFO L87 Difference]: Start difference. First operand 84 states and 124 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 11:20:47,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:20:47,539 INFO L93 Difference]: Finished difference Result 169 states and 250 transitions. [2024-10-24 11:20:47,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:20:47,543 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 93 [2024-10-24 11:20:47,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:20:47,544 INFO L225 Difference]: With dead ends: 169 [2024-10-24 11:20:47,544 INFO L226 Difference]: Without dead ends: 86 [2024-10-24 11:20:47,545 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:20:47,546 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:20:47,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 347 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:20:47,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-24 11:20:47,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-10-24 11:20:47,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 74 states have (on average 1.4324324324324325) internal successors, (106), 74 states have internal predecessors, (106), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-24 11:20:47,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 126 transitions. [2024-10-24 11:20:47,561 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 126 transitions. Word has length 93 [2024-10-24 11:20:47,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:20:47,562 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 126 transitions. [2024-10-24 11:20:47,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 11:20:47,562 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 126 transitions. [2024-10-24 11:20:47,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-24 11:20:47,564 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:20:47,564 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:20:47,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 11:20:47,565 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:20:47,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:20:47,565 INFO L85 PathProgramCache]: Analyzing trace with hash 894744439, now seen corresponding path program 1 times [2024-10-24 11:20:47,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:20:47,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95308254] [2024-10-24 11:20:47,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:20:47,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:20:47,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:20:47,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:20:47,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:20:47,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:20:47,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:20:47,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:20:47,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:20:47,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:20:47,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:20:47,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:20:47,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:20:47,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:20:47,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:20:47,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:20:47,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:20:47,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:20:47,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:20:47,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:20:47,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:20:47,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:20:47,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:20:47,882 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-24 11:20:47,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:20:47,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95308254] [2024-10-24 11:20:47,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95308254] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:20:47,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:20:47,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:20:47,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123145270] [2024-10-24 11:20:47,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:20:47,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:20:47,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:20:47,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:20:47,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:20:47,886 INFO L87 Difference]: Start difference. First operand 86 states and 126 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-24 11:20:47,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:20:47,937 INFO L93 Difference]: Finished difference Result 173 states and 254 transitions. [2024-10-24 11:20:47,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:20:47,938 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 93 [2024-10-24 11:20:47,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:20:47,939 INFO L225 Difference]: With dead ends: 173 [2024-10-24 11:20:47,940 INFO L226 Difference]: Without dead ends: 88 [2024-10-24 11:20:47,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:20:47,943 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:20:47,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 347 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:20:47,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-24 11:20:47,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-10-24 11:20:47,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 76 states have (on average 1.4210526315789473) internal successors, (108), 76 states have internal predecessors, (108), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-24 11:20:47,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 128 transitions. [2024-10-24 11:20:47,961 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 128 transitions. Word has length 93 [2024-10-24 11:20:47,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:20:47,961 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 128 transitions. [2024-10-24 11:20:47,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-24 11:20:47,961 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 128 transitions. [2024-10-24 11:20:47,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-24 11:20:47,963 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:20:47,963 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:20:47,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 11:20:47,963 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:20:47,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:20:47,964 INFO L85 PathProgramCache]: Analyzing trace with hash 81156796, now seen corresponding path program 1 times [2024-10-24 11:20:47,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:20:47,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544471462] [2024-10-24 11:20:47,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:20:47,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:20:48,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:20:48,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:20:48,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:20:48,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:20:48,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:20:48,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:20:48,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:20:48,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:20:48,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:20:48,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:20:48,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:20:48,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:20:48,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:20:48,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:20:48,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:20:48,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:20:48,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:20:48,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:20:48,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:20:48,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:20:48,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:20:48,223 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-24 11:20:48,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:20:48,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544471462] [2024-10-24 11:20:48,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544471462] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:20:48,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:20:48,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:20:48,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180088924] [2024-10-24 11:20:48,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:20:48,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:20:48,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:20:48,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:20:48,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:20:48,226 INFO L87 Difference]: Start difference. First operand 88 states and 128 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-24 11:20:48,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:20:48,312 INFO L93 Difference]: Finished difference Result 262 states and 382 transitions. [2024-10-24 11:20:48,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:20:48,313 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 95 [2024-10-24 11:20:48,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:20:48,315 INFO L225 Difference]: With dead ends: 262 [2024-10-24 11:20:48,317 INFO L226 Difference]: Without dead ends: 175 [2024-10-24 11:20:48,320 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:20:48,321 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 82 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:20:48,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 332 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:20:48,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-10-24 11:20:48,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 172. [2024-10-24 11:20:48,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 149 states have (on average 1.4161073825503356) internal successors, (211), 149 states have internal predecessors, (211), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 11:20:48,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 251 transitions. [2024-10-24 11:20:48,353 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 251 transitions. Word has length 95 [2024-10-24 11:20:48,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:20:48,354 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 251 transitions. [2024-10-24 11:20:48,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-24 11:20:48,354 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 251 transitions. [2024-10-24 11:20:48,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-24 11:20:48,355 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:20:48,355 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:20:48,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 11:20:48,356 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:20:48,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:20:48,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1198706882, now seen corresponding path program 1 times [2024-10-24 11:20:48,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:20:48,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381013698] [2024-10-24 11:20:48,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:20:48,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:20:48,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:20:48,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:20:48,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:20:48,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:20:48,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:20:48,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:20:48,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:20:48,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:20:48,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:20:48,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:20:48,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:20:48,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:20:48,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:20:48,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:20:48,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:20:48,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:20:48,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:20:48,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:20:48,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:20:48,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:20:48,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:20:48,846 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-24 11:20:48,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:20:48,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381013698] [2024-10-24 11:20:48,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381013698] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:20:48,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:20:48,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:20:48,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553958] [2024-10-24 11:20:48,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:20:48,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:20:48,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:20:48,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:20:48,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:20:48,848 INFO L87 Difference]: Start difference. First operand 172 states and 251 transitions. Second operand has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 11:20:48,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:20:48,975 INFO L93 Difference]: Finished difference Result 421 states and 607 transitions. [2024-10-24 11:20:48,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:20:48,977 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 95 [2024-10-24 11:20:48,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:20:48,980 INFO L225 Difference]: With dead ends: 421 [2024-10-24 11:20:48,980 INFO L226 Difference]: Without dead ends: 250 [2024-10-24 11:20:48,982 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:20:48,984 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 47 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:20:48,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 563 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:20:48,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-10-24 11:20:49,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 246. [2024-10-24 11:20:49,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 217 states have (on average 1.400921658986175) internal successors, (304), 219 states have internal predecessors, (304), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 11:20:49,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 352 transitions. [2024-10-24 11:20:49,017 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 352 transitions. Word has length 95 [2024-10-24 11:20:49,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:20:49,019 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 352 transitions. [2024-10-24 11:20:49,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 11:20:49,019 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 352 transitions. [2024-10-24 11:20:49,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-24 11:20:49,020 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:20:49,021 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:20:49,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 11:20:49,021 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:20:49,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:20:49,024 INFO L85 PathProgramCache]: Analyzing trace with hash -611900868, now seen corresponding path program 1 times [2024-10-24 11:20:49,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:20:49,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944390413] [2024-10-24 11:20:49,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:20:49,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:20:49,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:20:49,109 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 11:20:49,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:20:49,199 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 11:20:49,202 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 11:20:49,203 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 11:20:49,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 11:20:49,208 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-24 11:20:49,293 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 11:20:49,296 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 11:20:49 BoogieIcfgContainer [2024-10-24 11:20:49,300 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 11:20:49,301 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 11:20:49,302 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 11:20:49,302 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 11:20:49,303 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:20:46" (3/4) ... [2024-10-24 11:20:49,306 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 11:20:49,307 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 11:20:49,308 INFO L158 Benchmark]: Toolchain (without parser) took 3988.74ms. Allocated memory was 163.6MB in the beginning and 197.1MB in the end (delta: 33.6MB). Free memory was 98.4MB in the beginning and 100.5MB in the end (delta: -2.1MB). Peak memory consumption was 30.2MB. Max. memory is 16.1GB. [2024-10-24 11:20:49,310 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory was 50.7MB in the beginning and 50.7MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:20:49,311 INFO L158 Benchmark]: CACSL2BoogieTranslator took 390.48ms. Allocated memory is still 163.6MB. Free memory was 98.4MB in the beginning and 130.3MB in the end (delta: -31.9MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. [2024-10-24 11:20:49,311 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.29ms. Allocated memory is still 163.6MB. Free memory was 129.7MB in the beginning and 126.4MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 11:20:49,311 INFO L158 Benchmark]: Boogie Preprocessor took 90.81ms. Allocated memory is still 163.6MB. Free memory was 126.4MB in the beginning and 121.9MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 11:20:49,311 INFO L158 Benchmark]: RCFGBuilder took 643.23ms. Allocated memory is still 163.6MB. Free memory was 121.9MB in the beginning and 87.2MB in the end (delta: 34.8MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-10-24 11:20:49,312 INFO L158 Benchmark]: TraceAbstraction took 2797.64ms. Allocated memory was 163.6MB in the beginning and 197.1MB in the end (delta: 33.6MB). Free memory was 86.5MB in the beginning and 100.5MB in the end (delta: -14.0MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. [2024-10-24 11:20:49,312 INFO L158 Benchmark]: Witness Printer took 6.56ms. Allocated memory is still 197.1MB. Free memory is still 100.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:20:49,313 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory was 50.7MB in the beginning and 50.7MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 390.48ms. Allocated memory is still 163.6MB. Free memory was 98.4MB in the beginning and 130.3MB in the end (delta: -31.9MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.29ms. Allocated memory is still 163.6MB. Free memory was 129.7MB in the beginning and 126.4MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 90.81ms. Allocated memory is still 163.6MB. Free memory was 126.4MB in the beginning and 121.9MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 643.23ms. Allocated memory is still 163.6MB. Free memory was 121.9MB in the beginning and 87.2MB in the end (delta: 34.8MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 2797.64ms. Allocated memory was 163.6MB in the beginning and 197.1MB in the end (delta: 33.6MB). Free memory was 86.5MB in the beginning and 100.5MB in the end (delta: -14.0MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. * Witness Printer took 6.56ms. Allocated memory is still 197.1MB. Free memory is still 100.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 90, overapproximation of someBinaryArithmeticDOUBLEoperation at line 65, overapproximation of someBinaryDOUBLEComparisonOperation at line 78, overapproximation of someBinaryArithmeticFLOAToperation at line 53. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 0 }; [L25-L27] double double_Array_0[3] = { 128.5, 0.0, 127.875 }; [L25-L27] double double_Array_0[3] = { 128.5, 0.0, 127.875 }; [L25-L27] double double_Array_0[3] = { 128.5, 0.0, 127.875 }; [L25-L27] double double_Array_0[3] = { 128.5, 0.0, 127.875 }; [L28-L30] float float_Array_0[3] = { 100.55, 4.75, 128.75 }; [L28-L30] float float_Array_0[3] = { 100.55, 4.75, 128.75 }; [L28-L30] float float_Array_0[3] = { 100.55, 4.75, 128.75 }; [L28-L30] float float_Array_0[3] = { 100.55, 4.75, 128.75 }; [L31-L33] signed long int signed_long_int_Array_0[1] = { -200 }; [L31-L33] signed long int signed_long_int_Array_0[1] = { -200 }; [L34-L36] unsigned char unsigned_char_Array_0[2] = { 16, 1 }; [L34-L36] unsigned char unsigned_char_Array_0[2] = { 16, 1 }; [L34-L36] unsigned char unsigned_char_Array_0[2] = { 16, 1 }; [L94] isInitial = 1 [L95] FCALL initially() [L96] COND TRUE 1 [L97] FCALL updateLastVariables() [L98] CALL updateVariables() [L69] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L70] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L70] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8: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, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L70] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L71] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L71] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8: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, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L71] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L72] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L73] 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, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L73] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8: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, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L73] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L74] 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, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L74] 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, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8: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, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L74] 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, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L75] double_Array_0[1] = __VERIFIER_nondet_double() [L76] EXPR double_Array_0[1] [L76] EXPR double_Array_0[1] >= 4611686.018427382800e+12F && double_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, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L76] EXPR double_Array_0[1] >= 4611686.018427382800e+12F && double_Array_0[1] <= -1.0e-20F [L76] EXPR double_Array_0[1] [L76] EXPR double_Array_0[1] >= 4611686.018427382800e+12F && double_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, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L76] EXPR (double_Array_0[1] >= 4611686.018427382800e+12F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_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, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L76] EXPR (double_Array_0[1] >= 4611686.018427382800e+12F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_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, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L76] CALL assume_abort_if_not((double_Array_0[1] >= 4611686.018427382800e+12F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_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, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8: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, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L76] RET assume_abort_if_not((double_Array_0[1] >= 4611686.018427382800e+12F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_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, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L77] double_Array_0[2] = __VERIFIER_nondet_double() [L78] EXPR double_Array_0[2] [L78] EXPR double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L78] EXPR double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F [L78] EXPR double_Array_0[2] [L78] EXPR double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L78] EXPR (double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 4611686.018427382800e+12F && double_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L78] EXPR (double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 4611686.018427382800e+12F && double_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L78] CALL assume_abort_if_not((double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 4611686.018427382800e+12F && double_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8: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, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L78] RET assume_abort_if_not((double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 4611686.018427382800e+12F && double_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L79] float_Array_0[1] = __VERIFIER_nondet_float() [L80] EXPR float_Array_0[1] [L80] EXPR float_Array_0[1] >= 0.0F && 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, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L80] EXPR float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F [L80] EXPR float_Array_0[1] [L80] EXPR float_Array_0[1] >= 0.0F && 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, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L80] EXPR (float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+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, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L80] EXPR (float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+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, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L80] CALL assume_abort_if_not((float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+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, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8: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, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L80] RET assume_abort_if_not((float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+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, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L81] float_Array_0[2] = __VERIFIER_nondet_float() [L82] EXPR float_Array_0[2] [L82] EXPR float_Array_0[2] >= 0.0F && 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, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] EXPR float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F [L82] EXPR float_Array_0[2] [L82] EXPR float_Array_0[2] >= 0.0F && 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, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] EXPR (float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854765600e+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, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] EXPR (float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854765600e+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, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] CALL assume_abort_if_not((float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854765600e+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, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8: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, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] RET assume_abort_if_not((float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854765600e+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, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L83] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L84] EXPR 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, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L84] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8: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, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L84] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L85] EXPR 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, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L85] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8: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, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L85] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L98] RET updateVariables() [L99] CALL step() [L40] 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, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L40] COND TRUE 0.8f > (- float_Array_0[1]) [L41] EXPR unsigned_char_Array_0[0] [L41] unsigned_char_Array_0[1] = unsigned_char_Array_0[0] [L43] EXPR unsigned_char_Array_0[1] [L43] EXPR unsigned_char_Array_0[1] [L43] unsigned char stepLocal_1 = unsigned_char_Array_0[1] > unsigned_char_Array_0[1]; [L44] EXPR BOOL_unsigned_char_Array_0[0] [L44] unsigned char stepLocal_0 = BOOL_unsigned_char_Array_0[0]; [L45] 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, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L45] COND FALSE !(BOOL_unsigned_char_Array_0[1] && stepLocal_0) [L52] 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, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L52] COND TRUE BOOL_unsigned_char_Array_0[1] [L53] EXPR float_Array_0[1] [L53] EXPR float_Array_0[2] [L53] float_Array_0[0] = (float_Array_0[1] - float_Array_0[2]) [L61] EXPR signed_long_int_Array_0[0] [L61] signed long int stepLocal_2 = signed_long_int_Array_0[0]; [L62] COND FALSE !(stepLocal_2 <= ((((8u) < 0 ) ? -(8u) : (8u)))) [L65] EXPR double_Array_0[1] [L65] EXPR double_Array_0[2] [L65] EXPR float_Array_0[2] [L65] double_Array_0[0] = ((double_Array_0[1] - double_Array_0[2]) - float_Array_0[2]) [L99] RET step() [L100] CALL, EXPR property() [L90] EXPR BOOL_unsigned_char_Array_0[1] [L90] EXPR BOOL_unsigned_char_Array_0[1] && 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, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L90] EXPR BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0] [L90] EXPR BOOL_unsigned_char_Array_0[0] [L90] EXPR BOOL_unsigned_char_Array_0[1] && 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, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L90] EXPR (BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? ((BOOL_unsigned_char_Array_0[1] && (unsigned_char_Array_0[1] > unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[0] == ((signed long int) ((unsigned_char_Array_0[1] + 5) - unsigned_char_Array_0[1])))) : 1 [L90] EXPR (BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? ((BOOL_unsigned_char_Array_0[1] && (unsigned_char_Array_0[1] > unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[0] == ((signed long int) ((unsigned_char_Array_0[1] + 5) - 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, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L90] EXPR ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? ((BOOL_unsigned_char_Array_0[1] && (unsigned_char_Array_0[1] > unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[0] == ((signed long int) ((unsigned_char_Array_0[1] + 5) - unsigned_char_Array_0[1])))) : 1) && (BOOL_unsigned_char_Array_0[1] ? (float_Array_0[0] == ((float) (float_Array_0[1] - float_Array_0[2]))) : ((signed_long_int_Array_0[0] < unsigned_char_Array_0[1]) ? (float_Array_0[0] == ((float) ((((float_Array_0[2]) > (float_Array_0[1])) ? (float_Array_0[2]) : (float_Array_0[1]))))) : (float_Array_0[0] == ((float) float_Array_0[1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L90] EXPR ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? ((BOOL_unsigned_char_Array_0[1] && (unsigned_char_Array_0[1] > unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[0] == ((signed long int) ((unsigned_char_Array_0[1] + 5) - unsigned_char_Array_0[1])))) : 1) && (BOOL_unsigned_char_Array_0[1] ? (float_Array_0[0] == ((float) (float_Array_0[1] - float_Array_0[2]))) : ((signed_long_int_Array_0[0] < unsigned_char_Array_0[1]) ? (float_Array_0[0] == ((float) ((((float_Array_0[2]) > (float_Array_0[1])) ? (float_Array_0[2]) : (float_Array_0[1]))))) : (float_Array_0[0] == ((float) float_Array_0[1])))) [L90] 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, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L90] EXPR BOOL_unsigned_char_Array_0[1] ? (float_Array_0[0] == ((float) (float_Array_0[1] - float_Array_0[2]))) : ((signed_long_int_Array_0[0] < unsigned_char_Array_0[1]) ? (float_Array_0[0] == ((float) ((((float_Array_0[2]) > (float_Array_0[1])) ? (float_Array_0[2]) : (float_Array_0[1]))))) : (float_Array_0[0] == ((float) float_Array_0[1]))) [L90] EXPR float_Array_0[0] [L90] EXPR float_Array_0[1] [L90] EXPR float_Array_0[2] [L90] EXPR BOOL_unsigned_char_Array_0[1] ? (float_Array_0[0] == ((float) (float_Array_0[1] - float_Array_0[2]))) : ((signed_long_int_Array_0[0] < unsigned_char_Array_0[1]) ? (float_Array_0[0] == ((float) ((((float_Array_0[2]) > (float_Array_0[1])) ? (float_Array_0[2]) : (float_Array_0[1]))))) : (float_Array_0[0] == ((float) float_Array_0[1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L90] EXPR ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? ((BOOL_unsigned_char_Array_0[1] && (unsigned_char_Array_0[1] > unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[0] == ((signed long int) ((unsigned_char_Array_0[1] + 5) - unsigned_char_Array_0[1])))) : 1) && (BOOL_unsigned_char_Array_0[1] ? (float_Array_0[0] == ((float) (float_Array_0[1] - float_Array_0[2]))) : ((signed_long_int_Array_0[0] < unsigned_char_Array_0[1]) ? (float_Array_0[0] == ((float) ((((float_Array_0[2]) > (float_Array_0[1])) ? (float_Array_0[2]) : (float_Array_0[1]))))) : (float_Array_0[0] == ((float) float_Array_0[1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L90] EXPR (((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? ((BOOL_unsigned_char_Array_0[1] && (unsigned_char_Array_0[1] > unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[0] == ((signed long int) ((unsigned_char_Array_0[1] + 5) - unsigned_char_Array_0[1])))) : 1) && (BOOL_unsigned_char_Array_0[1] ? (float_Array_0[0] == ((float) (float_Array_0[1] - float_Array_0[2]))) : ((signed_long_int_Array_0[0] < unsigned_char_Array_0[1]) ? (float_Array_0[0] == ((float) ((((float_Array_0[2]) > (float_Array_0[1])) ? (float_Array_0[2]) : (float_Array_0[1]))))) : (float_Array_0[0] == ((float) float_Array_0[1]))))) && ((signed_long_int_Array_0[0] <= ((((8u) < 0 ) ? -(8u) : (8u)))) ? (double_Array_0[0] == ((double) (float_Array_0[1] - 99.5))) : (double_Array_0[0] == ((double) ((double_Array_0[1] - double_Array_0[2]) - float_Array_0[2])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L90] EXPR (((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? ((BOOL_unsigned_char_Array_0[1] && (unsigned_char_Array_0[1] > unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[0] == ((signed long int) ((unsigned_char_Array_0[1] + 5) - unsigned_char_Array_0[1])))) : 1) && (BOOL_unsigned_char_Array_0[1] ? (float_Array_0[0] == ((float) (float_Array_0[1] - float_Array_0[2]))) : ((signed_long_int_Array_0[0] < unsigned_char_Array_0[1]) ? (float_Array_0[0] == ((float) ((((float_Array_0[2]) > (float_Array_0[1])) ? (float_Array_0[2]) : (float_Array_0[1]))))) : (float_Array_0[0] == ((float) float_Array_0[1]))))) && ((signed_long_int_Array_0[0] <= ((((8u) < 0 ) ? -(8u) : (8u)))) ? (double_Array_0[0] == ((double) (float_Array_0[1] - 99.5))) : (double_Array_0[0] == ((double) ((double_Array_0[1] - double_Array_0[2]) - float_Array_0[2])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L90] EXPR ((((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? ((BOOL_unsigned_char_Array_0[1] && (unsigned_char_Array_0[1] > unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[0] == ((signed long int) ((unsigned_char_Array_0[1] + 5) - unsigned_char_Array_0[1])))) : 1) && (BOOL_unsigned_char_Array_0[1] ? (float_Array_0[0] == ((float) (float_Array_0[1] - float_Array_0[2]))) : ((signed_long_int_Array_0[0] < unsigned_char_Array_0[1]) ? (float_Array_0[0] == ((float) ((((float_Array_0[2]) > (float_Array_0[1])) ? (float_Array_0[2]) : (float_Array_0[1]))))) : (float_Array_0[0] == ((float) float_Array_0[1]))))) && ((signed_long_int_Array_0[0] <= ((((8u) < 0 ) ? -(8u) : (8u)))) ? (double_Array_0[0] == ((double) (float_Array_0[1] - 99.5))) : (double_Array_0[0] == ((double) ((double_Array_0[1] - double_Array_0[2]) - float_Array_0[2]))))) && ((0.8f > (- float_Array_0[1])) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L90] EXPR ((((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? ((BOOL_unsigned_char_Array_0[1] && (unsigned_char_Array_0[1] > unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[0] == ((signed long int) ((unsigned_char_Array_0[1] + 5) - unsigned_char_Array_0[1])))) : 1) && (BOOL_unsigned_char_Array_0[1] ? (float_Array_0[0] == ((float) (float_Array_0[1] - float_Array_0[2]))) : ((signed_long_int_Array_0[0] < unsigned_char_Array_0[1]) ? (float_Array_0[0] == ((float) ((((float_Array_0[2]) > (float_Array_0[1])) ? (float_Array_0[2]) : (float_Array_0[1]))))) : (float_Array_0[0] == ((float) float_Array_0[1]))))) && ((signed_long_int_Array_0[0] <= ((((8u) < 0 ) ? -(8u) : (8u)))) ? (double_Array_0[0] == ((double) (float_Array_0[1] - 99.5))) : (double_Array_0[0] == ((double) ((double_Array_0[1] - double_Array_0[2]) - float_Array_0[2]))))) && ((0.8f > (- float_Array_0[1])) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L90-L91] return ((((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? ((BOOL_unsigned_char_Array_0[1] && (unsigned_char_Array_0[1] > unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[0] == ((signed long int) ((unsigned_char_Array_0[1] + 5) - unsigned_char_Array_0[1])))) : 1) && (BOOL_unsigned_char_Array_0[1] ? (float_Array_0[0] == ((float) (float_Array_0[1] - float_Array_0[2]))) : ((signed_long_int_Array_0[0] < unsigned_char_Array_0[1]) ? (float_Array_0[0] == ((float) ((((float_Array_0[2]) > (float_Array_0[1])) ? (float_Array_0[2]) : (float_Array_0[1]))))) : (float_Array_0[0] == ((float) float_Array_0[1]))))) && ((signed_long_int_Array_0[0] <= ((((8u) < 0 ) ? -(8u) : (8u)))) ? (double_Array_0[0] == ((double) (float_Array_0[1] - 99.5))) : (double_Array_0[0] == ((double) ((double_Array_0[1] - double_Array_0[2]) - float_Array_0[2]))))) && ((0.8f > (- float_Array_0[1])) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) ; [L100] RET, EXPR property() [L100] 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, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 86 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 6, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 130 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 129 mSDsluCounter, 1709 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1121 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 185 IncrementalHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 588 mSDtfsCounter, 185 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 133 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=246occurred in iteration=5, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 7 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 564 NumberOfCodeBlocks, 564 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 464 ConstructedInterpolants, 0 QuantifiedInterpolants, 855 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 900/900 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 11:20:49,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-78.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 99d92429afe7a1d3dd5b770cdd3a3c403da1aa6e04070cb3749a858d645383e6 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:20:51,530 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:20:51,606 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 11:20:51,615 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:20:51,616 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:20:51,659 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:20:51,660 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:20:51,660 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:20:51,661 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:20:51,661 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:20:51,662 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:20:51,662 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:20:51,663 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:20:51,664 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:20:51,664 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:20:51,665 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:20:51,665 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:20:51,665 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:20:51,666 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:20:51,666 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:20:51,666 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:20:51,668 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:20:51,668 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:20:51,669 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 11:20:51,669 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 11:20:51,669 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:20:51,669 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 11:20:51,670 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:20:51,670 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:20:51,670 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:20:51,671 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:20:51,672 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:20:51,672 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:20:51,672 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:20:51,672 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:20:51,673 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:20:51,673 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:20:51,673 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:20:51,674 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 11:20:51,674 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 11:20:51,674 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:20:51,675 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:20:51,675 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:20:51,675 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:20:51,675 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 11:20:51,676 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 99d92429afe7a1d3dd5b770cdd3a3c403da1aa6e04070cb3749a858d645383e6 [2024-10-24 11:20:51,977 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:20:52,003 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:20:52,005 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:20:52,007 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:20:52,008 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:20:52,010 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-78.i [2024-10-24 11:20:53,606 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:20:53,809 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:20:53,810 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-78.i [2024-10-24 11:20:53,822 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b41dcc07a/08e090573bd543e5ab980b144c97ead8/FLAG153497371 [2024-10-24 11:20:53,835 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b41dcc07a/08e090573bd543e5ab980b144c97ead8 [2024-10-24 11:20:53,837 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:20:53,838 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:20:53,839 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:20:53,840 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:20:53,846 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:20:53,847 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:20:53" (1/1) ... [2024-10-24 11:20:53,847 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c7161d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:20:53, skipping insertion in model container [2024-10-24 11:20:53,848 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:20:53" (1/1) ... [2024-10-24 11:20:53,872 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:20:54,066 WARN L248 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-78.i[916,929] [2024-10-24 11:20:54,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:20:54,173 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:20:54,184 WARN L248 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-78.i[916,929] [2024-10-24 11:20:54,236 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:20:54,266 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:20:54,267 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:20:54 WrapperNode [2024-10-24 11:20:54,267 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:20:54,268 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:20:54,268 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:20:54,268 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:20:54,275 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:20:54" (1/1) ... [2024-10-24 11:20:54,299 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:20:54" (1/1) ... [2024-10-24 11:20:54,352 INFO L138 Inliner]: procedures = 36, calls = 136, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 419 [2024-10-24 11:20:54,353 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:20:54,354 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:20:54,354 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:20:54,355 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:20:54,365 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:20:54" (1/1) ... [2024-10-24 11:20:54,365 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:20:54" (1/1) ... [2024-10-24 11:20:54,374 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:20:54" (1/1) ... [2024-10-24 11:20:54,413 INFO L175 MemorySlicer]: Split 110 memory accesses to 6 slices as follows [2, 16, 21, 39, 9, 23]. 35 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 2, 3, 3, 1, 2]. The 15 writes are split as follows [0, 2, 4, 5, 2, 2]. [2024-10-24 11:20:54,413 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:20:54" (1/1) ... [2024-10-24 11:20:54,415 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:20:54" (1/1) ... [2024-10-24 11:20:54,449 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:20:54" (1/1) ... [2024-10-24 11:20:54,459 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:20:54" (1/1) ... [2024-10-24 11:20:54,467 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:20:54" (1/1) ... [2024-10-24 11:20:54,470 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:20:54" (1/1) ... [2024-10-24 11:20:54,479 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:20:54,484 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:20:54,484 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:20:54,484 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:20:54,485 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:20:54" (1/1) ... [2024-10-24 11:20:54,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:20:54,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:20:54,512 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) [2024-10-24 11:20:54,515 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 [2024-10-24 11:20:54,552 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:20:54,553 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-24 11:20:54,553 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-24 11:20:54,553 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-10-24 11:20:54,553 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-10-24 11:20:54,553 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-10-24 11:20:54,553 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-10-24 11:20:54,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-24 11:20:54,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-24 11:20:54,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-10-24 11:20:54,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-10-24 11:20:54,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-10-24 11:20:54,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-10-24 11:20:54,554 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-24 11:20:54,554 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-24 11:20:54,554 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-24 11:20:54,554 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-24 11:20:54,555 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-10-24 11:20:54,555 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-10-24 11:20:54,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 11:20:54,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-24 11:20:54,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-24 11:20:54,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-24 11:20:54,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-10-24 11:20:54,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-10-24 11:20:54,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-24 11:20:54,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-24 11:20:54,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-10-24 11:20:54,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-10-24 11:20:54,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-10-24 11:20:54,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-10-24 11:20:54,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-24 11:20:54,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-24 11:20:54,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-10-24 11:20:54,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-10-24 11:20:54,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-10-24 11:20:54,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-10-24 11:20:54,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-10-24 11:20:54,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-10-24 11:20:54,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-10-24 11:20:54,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-10-24 11:20:54,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-10-24 11:20:54,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-10-24 11:20:54,558 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-24 11:20:54,558 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-24 11:20:54,558 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-24 11:20:54,558 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-10-24 11:20:54,558 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-10-24 11:20:54,558 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-10-24 11:20:54,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-24 11:20:54,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-24 11:20:54,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-10-24 11:20:54,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-10-24 11:20:54,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-10-24 11:20:54,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-10-24 11:20:54,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-24 11:20:54,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-24 11:20:54,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-10-24 11:20:54,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-10-24 11:20:54,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-10-24 11:20:54,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-10-24 11:20:54,559 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:20:54,560 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:20:54,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:20:54,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:20:54,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-24 11:20:54,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-24 11:20:54,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-24 11:20:54,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-10-24 11:20:54,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-10-24 11:20:54,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-10-24 11:20:54,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-24 11:20:54,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-24 11:20:54,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-24 11:20:54,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-10-24 11:20:54,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-10-24 11:20:54,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-10-24 11:20:54,729 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:20:54,731 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:20:56,253 INFO L? ?]: Removed 105 outVars from TransFormulas that were not future-live. [2024-10-24 11:20:56,253 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:20:56,305 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:20:56,305 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:20:56,306 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:20:56 BoogieIcfgContainer [2024-10-24 11:20:56,306 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:20:56,309 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:20:56,309 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:20:56,313 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:20:56,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:20:53" (1/3) ... [2024-10-24 11:20:56,314 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e732e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:20:56, skipping insertion in model container [2024-10-24 11:20:56,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:20:54" (2/3) ... [2024-10-24 11:20:56,315 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e732e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:20:56, skipping insertion in model container [2024-10-24 11:20:56,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:20:56" (3/3) ... [2024-10-24 11:20:56,316 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-78.i [2024-10-24 11:20:56,332 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:20:56,333 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:20:56,405 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:20:56,411 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;@723c4223, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:20:56,411 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:20:56,415 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 73 states have (on average 1.4931506849315068) internal successors, (109), 74 states have internal predecessors, (109), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-24 11:20:56,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-24 11:20:56,424 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:20:56,425 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:20:56,425 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:20:56,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:20:56,429 INFO L85 PathProgramCache]: Analyzing trace with hash -840123795, now seen corresponding path program 1 times [2024-10-24 11:20:56,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:20:56,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [718225518] [2024-10-24 11:20:56,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:20:56,442 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 [2024-10-24 11:20:56,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:20:56,445 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) [2024-10-24 11:20:56,447 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 [2024-10-24 11:20:56,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:20:56,850 INFO L255 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 11:20:56,858 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:20:56,888 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-24 11:20:56,888 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:20:56,889 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:20:56,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [718225518] [2024-10-24 11:20:56,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [718225518] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:20:56,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:20:56,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:20:56,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054605597] [2024-10-24 11:20:56,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:20:56,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:20:56,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:20:56,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:20:56,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:20:56,918 INFO L87 Difference]: Start difference. First operand has 86 states, 73 states have (on average 1.4931506849315068) internal successors, (109), 74 states have internal predecessors, (109), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 11:20:56,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:20:56,970 INFO L93 Difference]: Finished difference Result 169 states and 266 transitions. [2024-10-24 11:20:56,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:20:56,978 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 93 [2024-10-24 11:20:56,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:20:56,991 INFO L225 Difference]: With dead ends: 169 [2024-10-24 11:20:56,992 INFO L226 Difference]: Without dead ends: 84 [2024-10-24 11:20:57,004 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:20:57,008 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:20:57,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:20:57,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-24 11:20:57,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-24 11:20:57,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 72 states have (on average 1.4444444444444444) internal successors, (104), 72 states have internal predecessors, (104), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-24 11:20:57,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 124 transitions. [2024-10-24 11:20:57,056 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 124 transitions. Word has length 93 [2024-10-24 11:20:57,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:20:57,057 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 124 transitions. [2024-10-24 11:20:57,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 11:20:57,057 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 124 transitions. [2024-10-24 11:20:57,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-24 11:20:57,060 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:20:57,061 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:20:57,071 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 [2024-10-24 11:20:57,261 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 [2024-10-24 11:20:57,262 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:20:57,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:20:57,263 INFO L85 PathProgramCache]: Analyzing trace with hash 879225721, now seen corresponding path program 1 times [2024-10-24 11:20:57,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:20:57,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [125779864] [2024-10-24 11:20:57,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:20:57,264 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 [2024-10-24 11:20:57,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:20:57,267 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) [2024-10-24 11:20:57,268 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 [2024-10-24 11:20:57,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:20:57,626 INFO L255 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:20:57,630 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:20:57,684 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-24 11:20:57,684 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:20:57,685 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:20:57,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [125779864] [2024-10-24 11:20:57,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [125779864] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:20:57,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:20:57,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:20:57,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862092220] [2024-10-24 11:20:57,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:20:57,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:20:57,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:20:57,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:20:57,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:20:57,692 INFO L87 Difference]: Start difference. First operand 84 states and 124 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 11:20:57,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:20:57,807 INFO L93 Difference]: Finished difference Result 169 states and 250 transitions. [2024-10-24 11:20:57,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:20:57,808 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 93 [2024-10-24 11:20:57,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:20:57,810 INFO L225 Difference]: With dead ends: 169 [2024-10-24 11:20:57,811 INFO L226 Difference]: Without dead ends: 86 [2024-10-24 11:20:57,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:20:57,813 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:20:57,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 347 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:20:57,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-24 11:20:57,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-10-24 11:20:57,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 74 states have (on average 1.4324324324324325) internal successors, (106), 74 states have internal predecessors, (106), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-24 11:20:57,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 126 transitions. [2024-10-24 11:20:57,830 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 126 transitions. Word has length 93 [2024-10-24 11:20:57,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:20:57,831 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 126 transitions. [2024-10-24 11:20:57,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 11:20:57,831 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 126 transitions. [2024-10-24 11:20:57,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-24 11:20:57,834 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:20:57,834 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:20:57,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-24 11:20:58,034 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 [2024-10-24 11:20:58,035 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:20:58,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:20:58,036 INFO L85 PathProgramCache]: Analyzing trace with hash 894744439, now seen corresponding path program 1 times [2024-10-24 11:20:58,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:20:58,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [910213073] [2024-10-24 11:20:58,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:20:58,038 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 [2024-10-24 11:20:58,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:20:58,041 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) [2024-10-24 11:20:58,042 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 [2024-10-24 11:20:58,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:20:58,396 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:20:58,401 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:20:58,920 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-24 11:20:58,920 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:20:58,921 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:20:58,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [910213073] [2024-10-24 11:20:58,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [910213073] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:20:58,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:20:58,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:20:58,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412188026] [2024-10-24 11:20:58,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:20:58,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:20:58,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:20:58,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:20:58,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:20:58,923 INFO L87 Difference]: Start difference. First operand 86 states and 126 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-24 11:21:00,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:21:00,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:21:00,646 INFO L93 Difference]: Finished difference Result 256 states and 376 transitions. [2024-10-24 11:21:00,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:21:00,647 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 93 [2024-10-24 11:21:00,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:21:00,650 INFO L225 Difference]: With dead ends: 256 [2024-10-24 11:21:00,650 INFO L226 Difference]: Without dead ends: 171 [2024-10-24 11:21:00,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:21:00,652 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 69 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-24 11:21:00,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 332 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-24 11:21:00,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-10-24 11:21:00,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 168. [2024-10-24 11:21:00,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 145 states have (on average 1.4275862068965517) internal successors, (207), 145 states have internal predecessors, (207), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 11:21:00,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 247 transitions. [2024-10-24 11:21:00,672 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 247 transitions. Word has length 93 [2024-10-24 11:21:00,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:21:00,673 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 247 transitions. [2024-10-24 11:21:00,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-24 11:21:00,673 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 247 transitions. [2024-10-24 11:21:00,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-24 11:21:00,678 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:21:00,679 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:21:00,693 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 [2024-10-24 11:21:00,879 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 [2024-10-24 11:21:00,880 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:21:00,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:21:00,880 INFO L85 PathProgramCache]: Analyzing trace with hash 307938425, now seen corresponding path program 1 times [2024-10-24 11:21:00,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:21:00,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1986313157] [2024-10-24 11:21:00,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:21:00,881 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 [2024-10-24 11:21:00,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:21:00,884 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) [2024-10-24 11:21:00,886 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 [2024-10-24 11:21:01,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:01,263 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 11:21:01,271 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:21:01,865 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 87 proven. 18 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-10-24 11:21:01,865 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:21:02,089 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-24 11:21:02,089 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:21:02,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1986313157] [2024-10-24 11:21:02,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1986313157] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:21:02,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:21:02,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 11 [2024-10-24 11:21:02,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513457425] [2024-10-24 11:21:02,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:21:02,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:21:02,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:21:02,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:21:02,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-24 11:21:02,094 INFO L87 Difference]: Start difference. First operand 168 states and 247 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-24 11:21:02,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:21:02,339 INFO L93 Difference]: Finished difference Result 409 states and 595 transitions. [2024-10-24 11:21:02,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:21:02,340 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 93 [2024-10-24 11:21:02,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:21:02,342 INFO L225 Difference]: With dead ends: 409 [2024-10-24 11:21:02,342 INFO L226 Difference]: Without dead ends: 242 [2024-10-24 11:21:02,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:21:02,344 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 47 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:21:02,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 456 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:21:02,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-10-24 11:21:02,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 238. [2024-10-24 11:21:02,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 209 states have (on average 1.4162679425837321) internal successors, (296), 211 states have internal predecessors, (296), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 11:21:02,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 344 transitions. [2024-10-24 11:21:02,383 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 344 transitions. Word has length 93 [2024-10-24 11:21:02,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:21:02,384 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 344 transitions. [2024-10-24 11:21:02,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-24 11:21:02,384 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 344 transitions. [2024-10-24 11:21:02,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-24 11:21:02,393 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:21:02,393 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:21:02,409 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 [2024-10-24 11:21:02,593 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 [2024-10-24 11:21:02,594 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:21:02,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:21:02,595 INFO L85 PathProgramCache]: Analyzing trace with hash -393126153, now seen corresponding path program 1 times [2024-10-24 11:21:02,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:21:02,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [682963589] [2024-10-24 11:21:02,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:21:02,596 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 [2024-10-24 11:21:02,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:21:02,599 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) [2024-10-24 11:21:02,601 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 [2024-10-24 11:21:02,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:02,940 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:21:02,942 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:21:02,962 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-24 11:21:02,962 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:21:02,962 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:21:02,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [682963589] [2024-10-24 11:21:02,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [682963589] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:21:02,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:21:02,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:21:02,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520639287] [2024-10-24 11:21:02,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:21:02,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:21:02,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:21:02,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:21:02,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:21:02,964 INFO L87 Difference]: Start difference. First operand 238 states and 344 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-24 11:21:03,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:21:03,024 INFO L93 Difference]: Finished difference Result 483 states and 699 transitions. [2024-10-24 11:21:03,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:21:03,025 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 93 [2024-10-24 11:21:03,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:21:03,028 INFO L225 Difference]: With dead ends: 483 [2024-10-24 11:21:03,029 INFO L226 Difference]: Without dead ends: 246 [2024-10-24 11:21:03,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:21:03,031 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:21:03,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 347 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:21:03,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-10-24 11:21:03,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2024-10-24 11:21:03,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 217 states have (on average 1.400921658986175) internal successors, (304), 219 states have internal predecessors, (304), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 11:21:03,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 352 transitions. [2024-10-24 11:21:03,059 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 352 transitions. Word has length 93 [2024-10-24 11:21:03,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:21:03,059 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 352 transitions. [2024-10-24 11:21:03,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-24 11:21:03,060 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 352 transitions. [2024-10-24 11:21:03,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-24 11:21:03,061 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:21:03,061 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:21:03,075 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 (6)] Forceful destruction successful, exit code 0 [2024-10-24 11:21:03,262 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 [2024-10-24 11:21:03,263 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:21:03,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:21:03,263 INFO L85 PathProgramCache]: Analyzing trace with hash -611900868, now seen corresponding path program 1 times [2024-10-24 11:21:03,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:21:03,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [660130405] [2024-10-24 11:21:03,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:21:03,264 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 [2024-10-24 11:21:03,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:21:03,270 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) [2024-10-24 11:21:03,270 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 [2024-10-24 11:21:03,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:03,629 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 11:21:03,632 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:21:03,835 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:21:03,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 175 treesize of output 67 [2024-10-24 11:21:03,895 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-24 11:21:03,895 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:21:03,895 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:21:03,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [660130405] [2024-10-24 11:21:03,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [660130405] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:21:03,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:21:03,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:21:03,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547857768] [2024-10-24 11:21:03,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:21:03,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:21:03,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:21:03,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:21:03,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:21:03,898 INFO L87 Difference]: Start difference. First operand 246 states and 352 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 11:21:06,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:21:08,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:21:08,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:21:08,966 INFO L93 Difference]: Finished difference Result 493 states and 705 transitions. [2024-10-24 11:21:08,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:21:08,967 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 95 [2024-10-24 11:21:08,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:21:08,969 INFO L225 Difference]: With dead ends: 493 [2024-10-24 11:21:08,969 INFO L226 Difference]: Without dead ends: 248 [2024-10-24 11:21:08,970 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:21:08,970 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 107 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-10-24 11:21:08,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 351 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-10-24 11:21:08,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2024-10-24 11:21:08,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 246. [2024-10-24 11:21:08,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 217 states have (on average 1.391705069124424) internal successors, (302), 219 states have internal predecessors, (302), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 11:21:08,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 350 transitions. [2024-10-24 11:21:08,986 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 350 transitions. Word has length 95 [2024-10-24 11:21:08,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:21:08,987 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 350 transitions. [2024-10-24 11:21:08,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 11:21:08,987 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 350 transitions. [2024-10-24 11:21:08,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-24 11:21:08,988 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:21:08,988 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:21:09,007 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 (7)] Forceful destruction successful, exit code 0 [2024-10-24 11:21:09,189 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 [2024-10-24 11:21:09,189 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:21:09,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:21:09,190 INFO L85 PathProgramCache]: Analyzing trace with hash 650131392, now seen corresponding path program 1 times [2024-10-24 11:21:09,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:21:09,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1705265294] [2024-10-24 11:21:09,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:21:09,191 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 [2024-10-24 11:21:09,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:21:09,194 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) [2024-10-24 11:21:09,195 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 [2024-10-24 11:21:09,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:09,560 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 11:21:09,563 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:21:09,616 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-10-24 11:21:09,617 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:21:09,617 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:21:09,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1705265294] [2024-10-24 11:21:09,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1705265294] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:21:09,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:21:09,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:21:09,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871210413] [2024-10-24 11:21:09,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:21:09,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:21:09,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:21:09,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:21:09,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:21:09,619 INFO L87 Difference]: Start difference. First operand 246 states and 350 transitions. Second operand has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-24 11:21:09,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:21:09,832 INFO L93 Difference]: Finished difference Result 503 states and 713 transitions. [2024-10-24 11:21:09,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:21:09,833 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 97 [2024-10-24 11:21:09,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:21:09,834 INFO L225 Difference]: With dead ends: 503 [2024-10-24 11:21:09,834 INFO L226 Difference]: Without dead ends: 254 [2024-10-24 11:21:09,835 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:21:09,836 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 1 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:21:09,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 502 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:21:09,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-10-24 11:21:09,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 246. [2024-10-24 11:21:09,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 217 states have (on average 1.3824884792626728) internal successors, (300), 219 states have internal predecessors, (300), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 11:21:09,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 348 transitions. [2024-10-24 11:21:09,852 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 348 transitions. Word has length 97 [2024-10-24 11:21:09,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:21:09,852 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 348 transitions. [2024-10-24 11:21:09,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-24 11:21:09,853 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 348 transitions. [2024-10-24 11:21:09,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-24 11:21:09,854 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:21:09,854 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:21:09,871 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 [2024-10-24 11:21:10,054 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 [2024-10-24 11:21:10,055 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:21:10,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:21:10,055 INFO L85 PathProgramCache]: Analyzing trace with hash -303808766, now seen corresponding path program 1 times [2024-10-24 11:21:10,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:21:10,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [577576096] [2024-10-24 11:21:10,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:21:10,056 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 [2024-10-24 11:21:10,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:21:10,057 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) [2024-10-24 11:21:10,058 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 [2024-10-24 11:21:10,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:10,472 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 11:21:10,476 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:21:10,633 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:21:10,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2024-10-24 11:21:10,662 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-10-24 11:21:10,662 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:21:10,662 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:21:10,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [577576096] [2024-10-24 11:21:10,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [577576096] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:21:10,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:21:10,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:21:10,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841623814] [2024-10-24 11:21:10,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:21:10,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:21:10,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:21:10,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:21:10,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:21:10,665 INFO L87 Difference]: Start difference. First operand 246 states and 348 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 11:21:13,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:21:15,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:21:15,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:21:15,601 INFO L93 Difference]: Finished difference Result 493 states and 697 transitions. [2024-10-24 11:21:15,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:21:15,602 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 97 [2024-10-24 11:21:15,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:21:15,603 INFO L225 Difference]: With dead ends: 493 [2024-10-24 11:21:15,603 INFO L226 Difference]: Without dead ends: 248 [2024-10-24 11:21:15,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:21:15,605 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 96 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-10-24 11:21:15,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 340 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-10-24 11:21:15,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2024-10-24 11:21:15,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 246. [2024-10-24 11:21:15,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 217 states have (on average 1.3732718894009217) internal successors, (298), 219 states have internal predecessors, (298), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 11:21:15,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 346 transitions. [2024-10-24 11:21:15,625 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 346 transitions. Word has length 97 [2024-10-24 11:21:15,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:21:15,626 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 346 transitions. [2024-10-24 11:21:15,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 11:21:15,626 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 346 transitions. [2024-10-24 11:21:15,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-24 11:21:15,627 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:21:15,628 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:21:15,646 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 [2024-10-24 11:21:15,828 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 [2024-10-24 11:21:15,829 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:21:15,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:21:15,829 INFO L85 PathProgramCache]: Analyzing trace with hash -698918020, now seen corresponding path program 1 times [2024-10-24 11:21:15,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:21:15,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1816568828] [2024-10-24 11:21:15,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:21:15,830 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:21:15,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:21:15,833 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) [2024-10-24 11:21:15,834 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 [2024-10-24 11:21:16,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:16,283 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 11:21:16,286 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:21:16,457 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 95 treesize of output 41 [2024-10-24 11:21:16,479 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-24 11:21:16,479 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:21:16,479 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:21:16,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1816568828] [2024-10-24 11:21:16,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1816568828] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:21:16,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:21:16,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:21:16,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361652258] [2024-10-24 11:21:16,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:21:16,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:21:16,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:21:16,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:21:16,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:21:16,482 INFO L87 Difference]: Start difference. First operand 246 states and 346 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 11:21:18,249 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 [] [2024-10-24 11:21:19,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:21:21,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:21:21,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:21:21,775 INFO L93 Difference]: Finished difference Result 491 states and 691 transitions. [2024-10-24 11:21:21,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:21:21,776 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 99 [2024-10-24 11:21:21,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:21:21,779 INFO L225 Difference]: With dead ends: 491 [2024-10-24 11:21:21,779 INFO L226 Difference]: Without dead ends: 246 [2024-10-24 11:21:21,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:21:21,780 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 88 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:21:21,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 324 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2024-10-24 11:21:21,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-10-24 11:21:21,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 242. [2024-10-24 11:21:21,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 213 states have (on average 1.3708920187793427) internal successors, (292), 215 states have internal predecessors, (292), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 11:21:21,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 340 transitions. [2024-10-24 11:21:21,800 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 340 transitions. Word has length 99 [2024-10-24 11:21:21,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:21:21,802 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 340 transitions. [2024-10-24 11:21:21,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 11:21:21,802 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 340 transitions. [2024-10-24 11:21:21,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-24 11:21:21,803 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:21:21,804 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:21:21,822 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 (10)] Forceful destruction successful, exit code 0 [2024-10-24 11:21:22,004 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 [2024-10-24 11:21:22,004 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:21:22,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:21:22,005 INFO L85 PathProgramCache]: Analyzing trace with hash 583597380, now seen corresponding path program 1 times [2024-10-24 11:21:22,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:21:22,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [316418001] [2024-10-24 11:21:22,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:21:22,006 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 [2024-10-24 11:21:22,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:21:22,007 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) [2024-10-24 11:21:22,010 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 [2024-10-24 11:21:22,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:22,376 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 11:21:22,379 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:21:22,690 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 94 treesize of output 40 [2024-10-24 11:21:22,766 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 84 proven. 24 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-10-24 11:21:22,767 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:21:23,094 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 58 treesize of output 22 [2024-10-24 11:21:23,160 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-10-24 11:21:23,160 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:21:23,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [316418001] [2024-10-24 11:21:23,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [316418001] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 11:21:23,161 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 11:21:23,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2024-10-24 11:21:23,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918840216] [2024-10-24 11:21:23,161 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 11:21:23,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 11:21:23,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:21:23,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 11:21:23,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:21:23,163 INFO L87 Difference]: Start difference. First operand 242 states and 340 transitions. Second operand has 12 states, 11 states have (on average 7.909090909090909) internal successors, (87), 12 states have internal predecessors, (87), 4 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-10-24 11:21:26,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:21:28,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:21:28,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:21:28,429 INFO L93 Difference]: Finished difference Result 513 states and 713 transitions. [2024-10-24 11:21:28,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 11:21:28,430 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.909090909090909) internal successors, (87), 12 states have internal predecessors, (87), 4 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 101 [2024-10-24 11:21:28,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:21:28,432 INFO L225 Difference]: With dead ends: 513 [2024-10-24 11:21:28,432 INFO L226 Difference]: Without dead ends: 250 [2024-10-24 11:21:28,433 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2024-10-24 11:21:28,434 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 99 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-10-24 11:21:28,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 361 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-10-24 11:21:28,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-10-24 11:21:28,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 242. [2024-10-24 11:21:28,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 213 states have (on average 1.352112676056338) internal successors, (288), 215 states have internal predecessors, (288), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 11:21:28,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 336 transitions. [2024-10-24 11:21:28,451 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 336 transitions. Word has length 101 [2024-10-24 11:21:28,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:21:28,451 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 336 transitions. [2024-10-24 11:21:28,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.909090909090909) internal successors, (87), 12 states have internal predecessors, (87), 4 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-10-24 11:21:28,452 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 336 transitions. [2024-10-24 11:21:28,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-24 11:21:28,453 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:21:28,453 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:21:28,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-10-24 11:21:28,654 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 [2024-10-24 11:21:28,654 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:21:28,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:21:28,655 INFO L85 PathProgramCache]: Analyzing trace with hash 139696706, now seen corresponding path program 1 times [2024-10-24 11:21:28,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:21:28,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1408880576] [2024-10-24 11:21:28,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:21:28,656 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 [2024-10-24 11:21:28,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:21:28,660 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) [2024-10-24 11:21:28,661 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 [2024-10-24 11:21:29,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:29,108 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 11:21:29,110 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:21:29,274 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 95 treesize of output 41 [2024-10-24 11:21:29,300 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-10-24 11:21:29,301 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:21:29,301 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:21:29,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1408880576] [2024-10-24 11:21:29,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1408880576] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:21:29,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:21:29,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:21:29,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577174657] [2024-10-24 11:21:29,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:21:29,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:21:29,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:21:29,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:21:29,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:21:29,303 INFO L87 Difference]: Start difference. First operand 242 states and 336 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 11:21:31,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:21:33,399 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:21:33,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:21:33,536 INFO L93 Difference]: Finished difference Result 485 states and 673 transitions. [2024-10-24 11:21:33,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:21:33,537 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 101 [2024-10-24 11:21:33,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:21:33,540 INFO L225 Difference]: With dead ends: 485 [2024-10-24 11:21:33,540 INFO L226 Difference]: Without dead ends: 244 [2024-10-24 11:21:33,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:21:33,542 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 77 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:21:33,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 311 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-10-24 11:21:33,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-10-24 11:21:33,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 242. [2024-10-24 11:21:33,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 213 states have (on average 1.3427230046948357) internal successors, (286), 215 states have internal predecessors, (286), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 11:21:33,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 334 transitions. [2024-10-24 11:21:33,557 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 334 transitions. Word has length 101 [2024-10-24 11:21:33,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:21:33,558 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 334 transitions. [2024-10-24 11:21:33,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 11:21:33,558 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 334 transitions. [2024-10-24 11:21:33,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-24 11:21:33,559 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:21:33,560 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:21:33,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-10-24 11:21:33,760 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 [2024-10-24 11:21:33,761 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:21:33,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:21:33,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1633297596, now seen corresponding path program 1 times [2024-10-24 11:21:33,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:21:33,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [917311051] [2024-10-24 11:21:33,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:21:33,762 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 [2024-10-24 11:21:33,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:21:33,763 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) [2024-10-24 11:21:33,764 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 [2024-10-24 11:21:48,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:21:48,853 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-10-24 11:21:48,858 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:21:49,007 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 [2024-10-24 11:21:49,909 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 78 treesize of output 32 [2024-10-24 11:21:52,017 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:21:52,018 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 204 treesize of output 99 [2024-10-24 11:21:56,860 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:21:56,861 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 343 treesize of output 127 [2024-10-24 11:21:58,195 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 104 proven. 12 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-24 11:21:58,196 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:22:06,972 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:22:06,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [917311051] [2024-10-24 11:22:06,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [917311051] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:22:06,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [848861146] [2024-10-24 11:22:06,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:22:06,973 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 11:22:06,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 11:22:06,974 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 11:22:06,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process