./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-1.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 e5e12694fa2cc5566bc8c3de95aa8f90b8dcd04904e4595c1a38d5095b0a77e4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 09:11:15,824 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 09:11:15,889 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 09:11:15,894 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 09:11:15,894 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 09:11:15,914 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 09:11:15,915 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 09:11:15,915 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 09:11:15,916 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 09:11:15,916 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 09:11:15,917 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 09:11:15,917 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 09:11:15,918 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 09:11:15,918 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 09:11:15,918 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 09:11:15,919 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 09:11:15,919 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 09:11:15,923 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 09:11:15,924 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 09:11:15,924 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 09:11:15,924 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 09:11:15,925 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 09:11:15,925 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 09:11:15,925 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 09:11:15,926 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 09:11:15,926 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 09:11:15,926 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 09:11:15,930 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 09:11:15,930 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 09:11:15,930 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 09:11:15,931 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 09:11:15,931 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 09:11:15,931 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:11:15,931 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 09:11:15,932 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 09:11:15,932 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 09:11:15,932 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 09:11:15,932 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 09:11:15,933 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 09:11:15,933 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 09:11:15,934 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 09:11:15,934 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 09:11:15,934 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 -> e5e12694fa2cc5566bc8c3de95aa8f90b8dcd04904e4595c1a38d5095b0a77e4 [2024-11-10 09:11:16,169 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 09:11:16,198 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 09:11:16,203 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 09:11:16,204 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 09:11:16,205 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 09:11:16,206 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-1.i [2024-11-10 09:11:17,750 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 09:11:17,954 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 09:11:17,955 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-1.i [2024-11-10 09:11:17,964 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d6606afb/4d18268f28cd46eca01fa322a6f98cea/FLAGf9207f056 [2024-11-10 09:11:17,977 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d6606afb/4d18268f28cd46eca01fa322a6f98cea [2024-11-10 09:11:17,981 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 09:11:17,985 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 09:11:17,987 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 09:11:17,987 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 09:11:17,992 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 09:11:17,993 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:11:17" (1/1) ... [2024-11-10 09:11:17,993 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35a2d005 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:11:17, skipping insertion in model container [2024-11-10 09:11:17,994 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:11:17" (1/1) ... [2024-11-10 09:11:18,021 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 09:11:18,175 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-1.i[915,928] [2024-11-10 09:11:18,244 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:11:18,254 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 09:11:18,268 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-1.i[915,928] [2024-11-10 09:11:18,323 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:11:18,349 INFO L204 MainTranslator]: Completed translation [2024-11-10 09:11:18,353 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:11:18 WrapperNode [2024-11-10 09:11:18,354 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 09:11:18,357 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 09:11:18,358 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 09:11:18,358 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 09:11:18,366 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:11:18" (1/1) ... [2024-11-10 09:11:18,396 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:11:18" (1/1) ... [2024-11-10 09:11:18,441 INFO L138 Inliner]: procedures = 29, calls = 158, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 491 [2024-11-10 09:11:18,442 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 09:11:18,443 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 09:11:18,443 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 09:11:18,443 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 09:11:18,454 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:11:18" (1/1) ... [2024-11-10 09:11:18,455 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:11:18" (1/1) ... [2024-11-10 09:11:18,469 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:11:18" (1/1) ... [2024-11-10 09:11:18,511 INFO L175 MemorySlicer]: Split 127 memory accesses to 7 slices as follows [2, 14, 39, 34, 21, 11, 6]. 31 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 2, 4, 4, 1, 1, 1]. The 17 writes are split as follows [0, 2, 6, 5, 1, 1, 2]. [2024-11-10 09:11:18,512 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:11:18" (1/1) ... [2024-11-10 09:11:18,512 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:11:18" (1/1) ... [2024-11-10 09:11:18,534 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:11:18" (1/1) ... [2024-11-10 09:11:18,536 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:11:18" (1/1) ... [2024-11-10 09:11:18,538 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:11:18" (1/1) ... [2024-11-10 09:11:18,541 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:11:18" (1/1) ... [2024-11-10 09:11:18,549 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 09:11:18,550 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 09:11:18,551 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 09:11:18,551 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 09:11:18,552 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:11:18" (1/1) ... [2024-11-10 09:11:18,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:11:18,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:11:18,596 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-11-10 09:11:18,599 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-11-10 09:11:18,656 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 09:11:18,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 09:11:18,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 09:11:18,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-10 09:11:18,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-10 09:11:18,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-10 09:11:18,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-10 09:11:18,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-10 09:11:18,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-10 09:11:18,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-10 09:11:18,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-10 09:11:18,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-10 09:11:18,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-10 09:11:18,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-10 09:11:18,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-11-10 09:11:18,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-10 09:11:18,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-10 09:11:18,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-10 09:11:18,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-10 09:11:18,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-10 09:11:18,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-10 09:11:18,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-11-10 09:11:18,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 09:11:18,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 09:11:18,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-10 09:11:18,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-10 09:11:18,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-10 09:11:18,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-10 09:11:18,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-10 09:11:18,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-10 09:11:18,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-10 09:11:18,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-10 09:11:18,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-10 09:11:18,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-10 09:11:18,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-10 09:11:18,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-11-10 09:11:18,662 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 09:11:18,662 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 09:11:18,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 09:11:18,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 09:11:18,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-10 09:11:18,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-10 09:11:18,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-10 09:11:18,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-10 09:11:18,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-10 09:11:18,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 09:11:18,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 09:11:18,832 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 09:11:18,840 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 09:11:19,280 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L102: havoc property_#t~mem81#1;havoc property_#t~mem80#1;havoc property_#t~ite93#1;havoc property_#t~mem86#1;havoc property_#t~mem82#1;havoc property_#t~ite85#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~mem87#1;havoc property_#t~ite92#1;havoc property_#t~mem89#1;havoc property_#t~mem88#1;havoc property_#t~mem91#1;havoc property_#t~mem90#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~short96#1;havoc property_#t~ite106#1;havoc property_#t~mem102#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~ite101#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~mem105#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~short107#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~bitwise110#1;havoc property_#t~mem111#1;havoc property_#t~ite114#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~ite127#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~ite126#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~mem120#1;havoc property_#t~ite125#1;havoc property_#t~mem122#1;havoc property_#t~mem121#1;havoc property_#t~mem124#1;havoc property_#t~mem123#1;havoc property_#t~short128#1;havoc property_#t~mem130#1;havoc property_#t~mem129#1;havoc property_#t~short131#1;havoc property_#t~mem133#1;havoc property_#t~mem132#1;havoc property_#t~short134#1; [2024-11-10 09:11:19,334 INFO L? ?]: Removed 127 outVars from TransFormulas that were not future-live. [2024-11-10 09:11:19,335 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 09:11:19,362 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 09:11:19,362 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 09:11:19,362 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:11:19 BoogieIcfgContainer [2024-11-10 09:11:19,363 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 09:11:19,365 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 09:11:19,365 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 09:11:19,369 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 09:11:19,369 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:11:17" (1/3) ... [2024-11-10 09:11:19,370 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3550d97f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:11:19, skipping insertion in model container [2024-11-10 09:11:19,370 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:11:18" (2/3) ... [2024-11-10 09:11:19,370 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3550d97f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:11:19, skipping insertion in model container [2024-11-10 09:11:19,370 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:11:19" (3/3) ... [2024-11-10 09:11:19,371 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-1.i [2024-11-10 09:11:19,389 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 09:11:19,390 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 09:11:19,464 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 09:11:19,472 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;@2dfb57cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 09:11:19,473 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 09:11:19,478 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 95 states have (on average 1.4105263157894736) internal successors, (134), 96 states have internal predecessors, (134), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-10 09:11:19,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-10 09:11:19,495 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:11:19,496 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:11:19,497 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:11:19,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:11:19,503 INFO L85 PathProgramCache]: Analyzing trace with hash 782970654, now seen corresponding path program 1 times [2024-11-10 09:11:19,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:11:19,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626015578] [2024-11-10 09:11:19,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:11:19,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:11:19,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:19,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:11:19,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:19,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:11:19,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:19,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:11:19,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:19,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:11:19,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:19,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:11:19,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:19,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:11:19,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:19,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:11:19,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:19,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:11:19,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:19,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:11:19,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:19,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:11:19,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:19,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:11:19,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:19,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:11:19,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:19,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:11:19,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:19,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:11:19,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:19,972 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 09:11:19,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:11:19,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626015578] [2024-11-10 09:11:19,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626015578] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:11:19,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:11:19,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 09:11:19,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742677501] [2024-11-10 09:11:19,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:11:19,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 09:11:19,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:11:20,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 09:11:20,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:11:20,015 INFO L87 Difference]: Start difference. First operand has 112 states, 95 states have (on average 1.4105263157894736) internal successors, (134), 96 states have internal predecessors, (134), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-10 09:11:20,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:11:20,062 INFO L93 Difference]: Finished difference Result 216 states and 331 transitions. [2024-11-10 09:11:20,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 09:11:20,066 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 127 [2024-11-10 09:11:20,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:11:20,115 INFO L225 Difference]: With dead ends: 216 [2024-11-10 09:11:20,116 INFO L226 Difference]: Without dead ends: 107 [2024-11-10 09:11:20,124 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 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-11-10 09:11:20,131 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:11:20,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:11:20,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-10 09:11:20,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-11-10 09:11:20,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 91 states have (on average 1.3846153846153846) internal successors, (126), 91 states have internal predecessors, (126), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-10 09:11:20,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 154 transitions. [2024-11-10 09:11:20,252 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 154 transitions. Word has length 127 [2024-11-10 09:11:20,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:11:20,252 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 154 transitions. [2024-11-10 09:11:20,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-10 09:11:20,253 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 154 transitions. [2024-11-10 09:11:20,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-10 09:11:20,256 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:11:20,256 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:11:20,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 09:11:20,257 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:11:20,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:11:20,259 INFO L85 PathProgramCache]: Analyzing trace with hash -432845382, now seen corresponding path program 1 times [2024-11-10 09:11:20,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:11:20,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476726184] [2024-11-10 09:11:20,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:11:20,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:11:20,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:20,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:11:20,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:20,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:11:20,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:20,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:11:20,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:20,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:11:20,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:20,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:11:20,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:20,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:11:20,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:20,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:11:20,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:20,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:11:20,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:20,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:11:20,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:20,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:11:20,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:20,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:11:20,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:20,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:11:20,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:20,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:11:20,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:20,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:11:20,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:20,641 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 09:11:20,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:11:20,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476726184] [2024-11-10 09:11:20,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476726184] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:11:20,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:11:20,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:11:20,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837193586] [2024-11-10 09:11:20,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:11:20,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:11:20,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:11:20,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:11:20,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:11:20,646 INFO L87 Difference]: Start difference. First operand 107 states and 154 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 09:11:20,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:11:20,703 INFO L93 Difference]: Finished difference Result 214 states and 309 transitions. [2024-11-10 09:11:20,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:11:20,704 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 127 [2024-11-10 09:11:20,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:11:20,707 INFO L225 Difference]: With dead ends: 214 [2024-11-10 09:11:20,709 INFO L226 Difference]: Without dead ends: 110 [2024-11-10 09:11:20,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 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-11-10 09:11:20,712 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 1 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:11:20,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 436 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:11:20,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-10 09:11:20,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2024-11-10 09:11:20,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 93 states have (on average 1.3763440860215055) internal successors, (128), 93 states have internal predecessors, (128), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-10 09:11:20,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 156 transitions. [2024-11-10 09:11:20,733 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 156 transitions. Word has length 127 [2024-11-10 09:11:20,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:11:20,735 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 156 transitions. [2024-11-10 09:11:20,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 09:11:20,735 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 156 transitions. [2024-11-10 09:11:20,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-10 09:11:20,737 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:11:20,737 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:11:20,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 09:11:20,738 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:11:20,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:11:20,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1309964953, now seen corresponding path program 1 times [2024-11-10 09:11:20,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:11:20,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952859598] [2024-11-10 09:11:20,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:11:20,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:11:20,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:20,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:11:20,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:20,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:11:20,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:20,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:11:20,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:20,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:11:20,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:20,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:11:20,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:20,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:11:20,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:21,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:11:21,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:21,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:11:21,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:21,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:11:21,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:21,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:11:21,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:21,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:11:21,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:21,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:11:21,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:21,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:11:21,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:21,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:11:21,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:21,019 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 09:11:21,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:11:21,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952859598] [2024-11-10 09:11:21,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952859598] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:11:21,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:11:21,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:11:21,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114104970] [2024-11-10 09:11:21,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:11:21,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:11:21,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:11:21,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:11:21,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:11:21,024 INFO L87 Difference]: Start difference. First operand 109 states and 156 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 09:11:21,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:11:21,058 INFO L93 Difference]: Finished difference Result 218 states and 313 transitions. [2024-11-10 09:11:21,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:11:21,063 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 127 [2024-11-10 09:11:21,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:11:21,064 INFO L225 Difference]: With dead ends: 218 [2024-11-10 09:11:21,064 INFO L226 Difference]: Without dead ends: 112 [2024-11-10 09:11:21,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 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-11-10 09:11:21,069 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 1 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:11:21,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 439 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:11:21,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-10 09:11:21,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2024-11-10 09:11:21,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 95 states have (on average 1.368421052631579) internal successors, (130), 95 states have internal predecessors, (130), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-10 09:11:21,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 158 transitions. [2024-11-10 09:11:21,086 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 158 transitions. Word has length 127 [2024-11-10 09:11:21,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:11:21,086 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 158 transitions. [2024-11-10 09:11:21,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 09:11:21,087 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 158 transitions. [2024-11-10 09:11:21,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-10 09:11:21,091 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:11:21,092 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:11:21,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 09:11:21,092 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:11:21,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:11:21,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1338594104, now seen corresponding path program 1 times [2024-11-10 09:11:21,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:11:21,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867571462] [2024-11-10 09:11:21,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:11:21,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:11:21,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:21,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:11:21,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:21,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:11:21,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:21,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:11:21,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:21,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:11:21,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:21,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:11:21,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:21,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:11:21,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:21,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:11:21,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:21,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:11:21,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:21,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:11:21,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:21,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:11:21,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:21,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:11:21,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:21,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:11:21,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:21,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:11:21,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:21,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:11:21,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:21,909 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 09:11:21,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:11:21,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867571462] [2024-11-10 09:11:21,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867571462] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:11:21,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:11:21,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 09:11:21,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192885566] [2024-11-10 09:11:21,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:11:21,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:11:21,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:11:21,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:11:21,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:11:21,912 INFO L87 Difference]: Start difference. First operand 111 states and 158 transitions. Second operand has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-10 09:11:22,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:11:22,075 INFO L93 Difference]: Finished difference Result 283 states and 400 transitions. [2024-11-10 09:11:22,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:11:22,079 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 127 [2024-11-10 09:11:22,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:11:22,081 INFO L225 Difference]: With dead ends: 283 [2024-11-10 09:11:22,081 INFO L226 Difference]: Without dead ends: 175 [2024-11-10 09:11:22,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 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-11-10 09:11:22,085 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 82 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 923 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:11:22,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 923 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:11:22,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-11-10 09:11:22,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 171. [2024-11-10 09:11:22,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 152 states have (on average 1.375) internal successors, (209), 153 states have internal predecessors, (209), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 09:11:22,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 241 transitions. [2024-11-10 09:11:22,106 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 241 transitions. Word has length 127 [2024-11-10 09:11:22,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:11:22,107 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 241 transitions. [2024-11-10 09:11:22,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-10 09:11:22,107 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 241 transitions. [2024-11-10 09:11:22,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-10 09:11:22,110 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:11:22,110 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:11:22,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 09:11:22,111 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:11:22,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:11:22,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1369613911, now seen corresponding path program 1 times [2024-11-10 09:11:22,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:11:22,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783340111] [2024-11-10 09:11:22,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:11:22,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:11:22,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:22,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:11:22,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:22,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:11:22,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:22,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:11:22,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:22,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:11:22,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:22,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:11:22,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:22,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:11:22,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:22,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:11:22,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:22,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:11:22,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:23,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:11:23,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:23,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:11:23,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:23,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:11:23,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:23,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:11:23,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:23,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:11:23,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:23,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:11:23,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:23,040 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 21 proven. 18 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-10 09:11:23,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:11:23,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783340111] [2024-11-10 09:11:23,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783340111] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 09:11:23,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593988200] [2024-11-10 09:11:23,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:11:23,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:11:23,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:11:23,047 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 09:11:23,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 09:11:23,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:23,284 INFO L255 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-10 09:11:23,295 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:11:23,419 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 27 treesize of output 11 [2024-11-10 09:11:23,499 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:11:23,499 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 34 treesize of output 33 [2024-11-10 09:11:23,559 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:11:23,560 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 38 treesize of output 14 [2024-11-10 09:11:23,581 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 195 proven. 18 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2024-11-10 09:11:23,584 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 09:11:23,848 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 21 proven. 18 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-10 09:11:23,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593988200] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 09:11:23,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 09:11:23,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 15 [2024-11-10 09:11:23,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890467395] [2024-11-10 09:11:23,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 09:11:23,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-10 09:11:23,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:11:23,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-10 09:11:23,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2024-11-10 09:11:23,851 INFO L87 Difference]: Start difference. First operand 171 states and 241 transitions. Second operand has 15 states, 12 states have (on average 9.333333333333334) internal successors, (112), 15 states have internal predecessors, (112), 7 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (35), 4 states have call predecessors, (35), 7 states have call successors, (35) [2024-11-10 09:11:24,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:11:24,420 INFO L93 Difference]: Finished difference Result 434 states and 608 transitions. [2024-11-10 09:11:24,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-10 09:11:24,421 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 9.333333333333334) internal successors, (112), 15 states have internal predecessors, (112), 7 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (35), 4 states have call predecessors, (35), 7 states have call successors, (35) Word has length 127 [2024-11-10 09:11:24,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:11:24,427 INFO L225 Difference]: With dead ends: 434 [2024-11-10 09:11:24,428 INFO L226 Difference]: Without dead ends: 266 [2024-11-10 09:11:24,429 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 273 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=187, Invalid=569, Unknown=0, NotChecked=0, Total=756 [2024-11-10 09:11:24,431 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 616 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 933 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 09:11:24,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [623 Valid, 933 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 09:11:24,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-11-10 09:11:24,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 256. [2024-11-10 09:11:24,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 228 states have (on average 1.368421052631579) internal successors, (312), 230 states have internal predecessors, (312), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-10 09:11:24,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 358 transitions. [2024-11-10 09:11:24,451 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 358 transitions. Word has length 127 [2024-11-10 09:11:24,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:11:24,452 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 358 transitions. [2024-11-10 09:11:24,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 9.333333333333334) internal successors, (112), 15 states have internal predecessors, (112), 7 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (35), 4 states have call predecessors, (35), 7 states have call successors, (35) [2024-11-10 09:11:24,452 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 358 transitions. [2024-11-10 09:11:24,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-10 09:11:24,454 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:11:24,454 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:11:24,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-10 09:11:24,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:11:24,655 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:11:24,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:11:24,656 INFO L85 PathProgramCache]: Analyzing trace with hash 960789686, now seen corresponding path program 1 times [2024-11-10 09:11:24,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:11:24,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705023326] [2024-11-10 09:11:24,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:11:24,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:11:24,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 09:11:24,724 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 09:11:24,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 09:11:24,839 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 09:11:24,839 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 09:11:24,842 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 09:11:24,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 09:11:24,846 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-10 09:11:24,959 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 09:11:24,962 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 09:11:24 BoogieIcfgContainer [2024-11-10 09:11:24,962 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 09:11:24,962 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 09:11:24,963 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 09:11:24,963 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 09:11:24,964 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:11:19" (3/4) ... [2024-11-10 09:11:24,966 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 09:11:24,968 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 09:11:24,968 INFO L158 Benchmark]: Toolchain (without parser) took 6983.33ms. Allocated memory was 155.2MB in the beginning and 297.8MB in the end (delta: 142.6MB). Free memory was 82.4MB in the beginning and 163.7MB in the end (delta: -81.3MB). Peak memory consumption was 63.5MB. Max. memory is 16.1GB. [2024-11-10 09:11:24,969 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 155.2MB. Free memory is still 105.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 09:11:24,969 INFO L158 Benchmark]: CACSL2BoogieTranslator took 368.91ms. Allocated memory is still 155.2MB. Free memory was 82.3MB in the beginning and 123.1MB in the end (delta: -40.9MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. [2024-11-10 09:11:24,970 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.88ms. Allocated memory was 155.2MB in the beginning and 216.0MB in the end (delta: 60.8MB). Free memory was 123.1MB in the beginning and 184.4MB in the end (delta: -61.3MB). Peak memory consumption was 3.1MB. Max. memory is 16.1GB. [2024-11-10 09:11:24,970 INFO L158 Benchmark]: Boogie Preprocessor took 107.04ms. Allocated memory is still 216.0MB. Free memory was 184.4MB in the beginning and 180.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 09:11:24,970 INFO L158 Benchmark]: IcfgBuilder took 812.19ms. Allocated memory is still 216.0MB. Free memory was 180.2MB in the beginning and 142.5MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-11-10 09:11:24,971 INFO L158 Benchmark]: TraceAbstraction took 5596.80ms. Allocated memory was 216.0MB in the beginning and 297.8MB in the end (delta: 81.8MB). Free memory was 141.4MB in the beginning and 163.7MB in the end (delta: -22.3MB). Peak memory consumption was 59.5MB. Max. memory is 16.1GB. [2024-11-10 09:11:24,971 INFO L158 Benchmark]: Witness Printer took 5.37ms. Allocated memory is still 297.8MB. Free memory is still 163.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 09:11:24,974 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 155.2MB. Free memory is still 105.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 368.91ms. Allocated memory is still 155.2MB. Free memory was 82.3MB in the beginning and 123.1MB in the end (delta: -40.9MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 84.88ms. Allocated memory was 155.2MB in the beginning and 216.0MB in the end (delta: 60.8MB). Free memory was 123.1MB in the beginning and 184.4MB in the end (delta: -61.3MB). Peak memory consumption was 3.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 107.04ms. Allocated memory is still 216.0MB. Free memory was 184.4MB in the beginning and 180.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 812.19ms. Allocated memory is still 216.0MB. Free memory was 180.2MB in the beginning and 142.5MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 5596.80ms. Allocated memory was 216.0MB in the beginning and 297.8MB in the end (delta: 81.8MB). Free memory was 141.4MB in the beginning and 163.7MB in the end (delta: -22.3MB). Peak memory consumption was 59.5MB. Max. memory is 16.1GB. * Witness Printer took 5.37ms. Allocated memory is still 297.8MB. Free memory is still 163.7MB. 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 102, overapproximation of someUnaryFLOAToperation at line 102. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L25-L27] float float_Array_0[2][2] = { {256.2, 10.375}, {127.5, 5.5} }; [L25-L27] float float_Array_0[2][2] = { {256.2, 10.375}, {127.5, 5.5} }; [L25-L27] float float_Array_0[2][2] = { {256.2, 10.375}, {127.5, 5.5} }; [L25-L27] float float_Array_0[2][2] = { {256.2, 10.375}, {127.5, 5.5} }; [L25-L27] float float_Array_0[2][2] = { {256.2, 10.375}, {127.5, 5.5} }; [L28-L30] signed long int signed_long_int_Array_0[2][2] = { {32, 100000000}, {2, 5} }; [L28-L30] signed long int signed_long_int_Array_0[2][2] = { {32, 100000000}, {2, 5} }; [L28-L30] signed long int signed_long_int_Array_0[2][2] = { {32, 100000000}, {2, 5} }; [L28-L30] signed long int signed_long_int_Array_0[2][2] = { {32, 100000000}, {2, 5} }; [L28-L30] signed long int signed_long_int_Array_0[2][2] = { {32, 100000000}, {2, 5} }; [L31-L33] signed short int signed_short_int_Array_0[1] = { 2 }; [L31-L33] signed short int signed_short_int_Array_0[1] = { 2 }; [L34-L36] unsigned char unsigned_char_Array_0[1] = { 50 }; [L34-L36] unsigned char unsigned_char_Array_0[1] = { 50 }; [L37-L39] unsigned long int unsigned_long_int_Array_0[1] = { 16 }; [L37-L39] unsigned long int unsigned_long_int_Array_0[1] = { 16 }; [L40] unsigned long int last_1_unsigned_long_int_Array_0_0_ = 16; VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=0, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L106] isInitial = 1 [L107] FCALL initially() [L108] COND TRUE 1 [L109] CALL updateLastVariables() [L99] EXPR unsigned_long_int_Array_0[0] [L99] last_1_unsigned_long_int_Array_0_0_ = unsigned_long_int_Array_0[0] [L109] RET updateLastVariables() [L110] CALL updateVariables() [L75] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L76] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L76] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L76] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L77] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L77] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L77] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L78] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L79] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L79] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L79] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L80] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L80] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L80] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L81] float_Array_0[0][0] = __VERIFIER_nondet_float() [L82] EXPR float_Array_0[0][0] [L82] EXPR float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L82] EXPR float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F [L82] EXPR float_Array_0[0][0] [L82] EXPR float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L82] EXPR (float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854765600e+12F && float_Array_0[0][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L82] EXPR (float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854765600e+12F && float_Array_0[0][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L82] CALL assume_abort_if_not((float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854765600e+12F && float_Array_0[0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L82] RET assume_abort_if_not((float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854765600e+12F && float_Array_0[0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L83] float_Array_0[1][0] = __VERIFIER_nondet_float() [L84] EXPR float_Array_0[1][0] [L84] EXPR float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L84] EXPR float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F [L84] EXPR float_Array_0[1][0] [L84] EXPR float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L84] EXPR (float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854776000e+12F && float_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L84] EXPR (float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854776000e+12F && float_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L84] CALL assume_abort_if_not((float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854776000e+12F && float_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L84] RET assume_abort_if_not((float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854776000e+12F && float_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L85] float_Array_0[0][1] = __VERIFIER_nondet_float() [L86] EXPR float_Array_0[0][1] [L86] EXPR float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L86] EXPR float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F [L86] EXPR float_Array_0[0][1] [L86] EXPR float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L86] EXPR (float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854776000e+12F && float_Array_0[0][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L86] EXPR (float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854776000e+12F && float_Array_0[0][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L86] CALL assume_abort_if_not((float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854776000e+12F && float_Array_0[0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L86] RET assume_abort_if_not((float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854776000e+12F && float_Array_0[0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L87] signed_long_int_Array_0[0][0] = __VERIFIER_nondet_long() [L88] EXPR signed_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L88] CALL assume_abort_if_not(signed_long_int_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L88] RET assume_abort_if_not(signed_long_int_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L89] EXPR signed_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L89] CALL assume_abort_if_not(signed_long_int_Array_0[0][0] <= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L89] RET assume_abort_if_not(signed_long_int_Array_0[0][0] <= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L90] signed_long_int_Array_0[1][0] = __VERIFIER_nondet_long() [L91] EXPR signed_long_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L91] CALL assume_abort_if_not(signed_long_int_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L91] RET assume_abort_if_not(signed_long_int_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L92] EXPR signed_long_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L92] CALL assume_abort_if_not(signed_long_int_Array_0[1][0] <= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L92] RET assume_abort_if_not(signed_long_int_Array_0[1][0] <= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L93] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L94] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L94] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L94] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L95] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L95] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 255) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L95] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 255) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] CALL assume_abort_if_not(unsigned_char_Array_0[0] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] RET assume_abort_if_not(unsigned_char_Array_0[0] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L110] RET updateVariables() [L111] CALL step() [L44] EXPR float_Array_0[0][1] [L44] EXPR float_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L44] COND FALSE !(float_Array_0[0][1] <= (- float_Array_0[1][0])) [L47] BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L47] COND FALSE !(BOOL_unsigned_char_Array_0[1]) [L50] EXPR float_Array_0[0][0] [L50] float_Array_0[1][1] = float_Array_0[0][0] [L53] EXPR unsigned_char_Array_0[0] [L53] signed_short_int_Array_0[0] = unsigned_char_Array_0[0] [L54] EXPR BOOL_unsigned_char_Array_0[0] [L54] unsigned char stepLocal_0 = BOOL_unsigned_char_Array_0[0]; [L55] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L55] COND FALSE !(BOOL_unsigned_char_Array_0[1] || stepLocal_0) [L58] EXPR signed_long_int_Array_0[0][0] [L58] EXPR signed_long_int_Array_0[1][0] [L58] signed_long_int_Array_0[1][1] = ((signed_long_int_Array_0[0][0] + signed_long_int_Array_0[1][0]) - 4) [L60] EXPR signed_long_int_Array_0[1][0] [L60] signed long int stepLocal_3 = signed_long_int_Array_0[1][0]; [L61] EXPR signed_short_int_Array_0[0] [L61] EXPR signed_long_int_Array_0[1][0] [L61] signed long int stepLocal_2 = signed_short_int_Array_0[0] + signed_long_int_Array_0[1][0]; [L62] EXPR signed_long_int_Array_0[1][0] [L62] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L62] EXPR signed_long_int_Array_0[1][0] << signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, stepLocal_2=1, stepLocal_3=0, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L62] signed long int stepLocal_1 = signed_long_int_Array_0[1][0] << signed_short_int_Array_0[0]; [L63] EXPR signed_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L63] EXPR ((signed_long_int_Array_0[0][0]) < 0 ) ? -(signed_long_int_Array_0[0][0]) : (signed_long_int_Array_0[0][0]) [L63] EXPR signed_long_int_Array_0[0][0] [L63] EXPR ((signed_long_int_Array_0[0][0]) < 0 ) ? -(signed_long_int_Array_0[0][0]) : (signed_long_int_Array_0[0][0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, stepLocal_1=0, stepLocal_2=1, stepLocal_3=0, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L63] COND FALSE !(stepLocal_1 != ((((signed_long_int_Array_0[0][0]) < 0 ) ? -(signed_long_int_Array_0[0][0]) : (signed_long_int_Array_0[0][0])))) [L72] EXPR signed_short_int_Array_0[0] [L72] signed_long_int_Array_0[0][1] = signed_short_int_Array_0[0] [L111] RET step() [L112] CALL, EXPR property() [L102] EXPR float_Array_0[0][1] [L102] EXPR float_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L102] EXPR (float_Array_0[0][1] <= (- float_Array_0[1][0])) ? (float_Array_0[1][1] == ((float) ((((float_Array_0[0][0]) < 0 ) ? -(float_Array_0[0][0]) : (float_Array_0[0][0]))))) : (BOOL_unsigned_char_Array_0[1] ? (float_Array_0[1][1] == ((float) float_Array_0[0][0])) : (float_Array_0[1][1] == ((float) float_Array_0[0][0]))) [L102] EXPR float_Array_0[1][1] [L102] EXPR float_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L102] EXPR ((float_Array_0[0][0]) < 0 ) ? -(float_Array_0[0][0]) : (float_Array_0[0][0]) [L102] EXPR float_Array_0[0][0] [L102] EXPR ((float_Array_0[0][0]) < 0 ) ? -(float_Array_0[0][0]) : (float_Array_0[0][0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L102] EXPR (float_Array_0[0][1] <= (- float_Array_0[1][0])) ? (float_Array_0[1][1] == ((float) ((((float_Array_0[0][0]) < 0 ) ? -(float_Array_0[0][0]) : (float_Array_0[0][0]))))) : (BOOL_unsigned_char_Array_0[1] ? (float_Array_0[1][1] == ((float) float_Array_0[0][0])) : (float_Array_0[1][1] == ((float) float_Array_0[0][0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L102] EXPR ((float_Array_0[0][1] <= (- float_Array_0[1][0])) ? (float_Array_0[1][1] == ((float) ((((float_Array_0[0][0]) < 0 ) ? -(float_Array_0[0][0]) : (float_Array_0[0][0]))))) : (BOOL_unsigned_char_Array_0[1] ? (float_Array_0[1][1] == ((float) float_Array_0[0][0])) : (float_Array_0[1][1] == ((float) float_Array_0[0][0])))) && ((BOOL_unsigned_char_Array_0[1] || BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[1][1] == ((signed long int) ((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[0])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[0]))))) : (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][0] + signed_long_int_Array_0[1][0]) - 4)))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L102] EXPR ((float_Array_0[0][1] <= (- float_Array_0[1][0])) ? (float_Array_0[1][1] == ((float) ((((float_Array_0[0][0]) < 0 ) ? -(float_Array_0[0][0]) : (float_Array_0[0][0]))))) : (BOOL_unsigned_char_Array_0[1] ? (float_Array_0[1][1] == ((float) float_Array_0[0][0])) : (float_Array_0[1][1] == ((float) float_Array_0[0][0])))) && ((BOOL_unsigned_char_Array_0[1] || BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[1][1] == ((signed long int) ((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[0])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[0]))))) : (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][0] + signed_long_int_Array_0[1][0]) - 4)))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L102] EXPR (((float_Array_0[0][1] <= (- float_Array_0[1][0])) ? (float_Array_0[1][1] == ((float) ((((float_Array_0[0][0]) < 0 ) ? -(float_Array_0[0][0]) : (float_Array_0[0][0]))))) : (BOOL_unsigned_char_Array_0[1] ? (float_Array_0[1][1] == ((float) float_Array_0[0][0])) : (float_Array_0[1][1] == ((float) float_Array_0[0][0])))) && ((BOOL_unsigned_char_Array_0[1] || BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[1][1] == ((signed long int) ((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[0])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[0]))))) : (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][0] + signed_long_int_Array_0[1][0]) - 4))))) && (((signed_long_int_Array_0[1][0] << signed_short_int_Array_0[0]) != ((((signed_long_int_Array_0[0][0]) < 0 ) ? -(signed_long_int_Array_0[0][0]) : (signed_long_int_Array_0[0][0])))) ? (((signed_short_int_Array_0[0] % unsigned_char_Array_0[0]) >= signed_long_int_Array_0[1][0]) ? (((signed_short_int_Array_0[0] + signed_long_int_Array_0[1][0]) > (last_1_unsigned_long_int_Array_0_0_ * signed_short_int_Array_0[0])) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[0])) : (unsigned_long_int_Array_0[0] == ((unsigned long int) signed_long_int_Array_0[0][0]))) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L102] EXPR (((float_Array_0[0][1] <= (- float_Array_0[1][0])) ? (float_Array_0[1][1] == ((float) ((((float_Array_0[0][0]) < 0 ) ? -(float_Array_0[0][0]) : (float_Array_0[0][0]))))) : (BOOL_unsigned_char_Array_0[1] ? (float_Array_0[1][1] == ((float) float_Array_0[0][0])) : (float_Array_0[1][1] == ((float) float_Array_0[0][0])))) && ((BOOL_unsigned_char_Array_0[1] || BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[1][1] == ((signed long int) ((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[0])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[0]))))) : (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][0] + signed_long_int_Array_0[1][0]) - 4))))) && (((signed_long_int_Array_0[1][0] << signed_short_int_Array_0[0]) != ((((signed_long_int_Array_0[0][0]) < 0 ) ? -(signed_long_int_Array_0[0][0]) : (signed_long_int_Array_0[0][0])))) ? (((signed_short_int_Array_0[0] % unsigned_char_Array_0[0]) >= signed_long_int_Array_0[1][0]) ? (((signed_short_int_Array_0[0] + signed_long_int_Array_0[1][0]) > (last_1_unsigned_long_int_Array_0_0_ * signed_short_int_Array_0[0])) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[0])) : (unsigned_long_int_Array_0[0] == ((unsigned long int) signed_long_int_Array_0[0][0]))) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L102] EXPR ((((float_Array_0[0][1] <= (- float_Array_0[1][0])) ? (float_Array_0[1][1] == ((float) ((((float_Array_0[0][0]) < 0 ) ? -(float_Array_0[0][0]) : (float_Array_0[0][0]))))) : (BOOL_unsigned_char_Array_0[1] ? (float_Array_0[1][1] == ((float) float_Array_0[0][0])) : (float_Array_0[1][1] == ((float) float_Array_0[0][0])))) && ((BOOL_unsigned_char_Array_0[1] || BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[1][1] == ((signed long int) ((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[0])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[0]))))) : (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][0] + signed_long_int_Array_0[1][0]) - 4))))) && (((signed_long_int_Array_0[1][0] << signed_short_int_Array_0[0]) != ((((signed_long_int_Array_0[0][0]) < 0 ) ? -(signed_long_int_Array_0[0][0]) : (signed_long_int_Array_0[0][0])))) ? (((signed_short_int_Array_0[0] % unsigned_char_Array_0[0]) >= signed_long_int_Array_0[1][0]) ? (((signed_short_int_Array_0[0] + signed_long_int_Array_0[1][0]) > (last_1_unsigned_long_int_Array_0_0_ * signed_short_int_Array_0[0])) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[0])) : (unsigned_long_int_Array_0[0] == ((unsigned long int) signed_long_int_Array_0[0][0]))) : 1) : 1)) && (signed_long_int_Array_0[0][1] == ((signed long int) signed_short_int_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L102] EXPR ((((float_Array_0[0][1] <= (- float_Array_0[1][0])) ? (float_Array_0[1][1] == ((float) ((((float_Array_0[0][0]) < 0 ) ? -(float_Array_0[0][0]) : (float_Array_0[0][0]))))) : (BOOL_unsigned_char_Array_0[1] ? (float_Array_0[1][1] == ((float) float_Array_0[0][0])) : (float_Array_0[1][1] == ((float) float_Array_0[0][0])))) && ((BOOL_unsigned_char_Array_0[1] || BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[1][1] == ((signed long int) ((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[0])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[0]))))) : (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][0] + signed_long_int_Array_0[1][0]) - 4))))) && (((signed_long_int_Array_0[1][0] << signed_short_int_Array_0[0]) != ((((signed_long_int_Array_0[0][0]) < 0 ) ? -(signed_long_int_Array_0[0][0]) : (signed_long_int_Array_0[0][0])))) ? (((signed_short_int_Array_0[0] % unsigned_char_Array_0[0]) >= signed_long_int_Array_0[1][0]) ? (((signed_short_int_Array_0[0] + signed_long_int_Array_0[1][0]) > (last_1_unsigned_long_int_Array_0_0_ * signed_short_int_Array_0[0])) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[0])) : (unsigned_long_int_Array_0[0] == ((unsigned long int) signed_long_int_Array_0[0][0]))) : 1) : 1)) && (signed_long_int_Array_0[0][1] == ((signed long int) signed_short_int_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L102] EXPR (((((float_Array_0[0][1] <= (- float_Array_0[1][0])) ? (float_Array_0[1][1] == ((float) ((((float_Array_0[0][0]) < 0 ) ? -(float_Array_0[0][0]) : (float_Array_0[0][0]))))) : (BOOL_unsigned_char_Array_0[1] ? (float_Array_0[1][1] == ((float) float_Array_0[0][0])) : (float_Array_0[1][1] == ((float) float_Array_0[0][0])))) && ((BOOL_unsigned_char_Array_0[1] || BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[1][1] == ((signed long int) ((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[0])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[0]))))) : (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][0] + signed_long_int_Array_0[1][0]) - 4))))) && (((signed_long_int_Array_0[1][0] << signed_short_int_Array_0[0]) != ((((signed_long_int_Array_0[0][0]) < 0 ) ? -(signed_long_int_Array_0[0][0]) : (signed_long_int_Array_0[0][0])))) ? (((signed_short_int_Array_0[0] % unsigned_char_Array_0[0]) >= signed_long_int_Array_0[1][0]) ? (((signed_short_int_Array_0[0] + signed_long_int_Array_0[1][0]) > (last_1_unsigned_long_int_Array_0_0_ * signed_short_int_Array_0[0])) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[0])) : (unsigned_long_int_Array_0[0] == ((unsigned long int) signed_long_int_Array_0[0][0]))) : 1) : 1)) && (signed_long_int_Array_0[0][1] == ((signed long int) signed_short_int_Array_0[0]))) && (signed_short_int_Array_0[0] == ((signed short int) unsigned_char_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L102] EXPR (((((float_Array_0[0][1] <= (- float_Array_0[1][0])) ? (float_Array_0[1][1] == ((float) ((((float_Array_0[0][0]) < 0 ) ? -(float_Array_0[0][0]) : (float_Array_0[0][0]))))) : (BOOL_unsigned_char_Array_0[1] ? (float_Array_0[1][1] == ((float) float_Array_0[0][0])) : (float_Array_0[1][1] == ((float) float_Array_0[0][0])))) && ((BOOL_unsigned_char_Array_0[1] || BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[1][1] == ((signed long int) ((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[0])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[0]))))) : (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][0] + signed_long_int_Array_0[1][0]) - 4))))) && (((signed_long_int_Array_0[1][0] << signed_short_int_Array_0[0]) != ((((signed_long_int_Array_0[0][0]) < 0 ) ? -(signed_long_int_Array_0[0][0]) : (signed_long_int_Array_0[0][0])))) ? (((signed_short_int_Array_0[0] % unsigned_char_Array_0[0]) >= signed_long_int_Array_0[1][0]) ? (((signed_short_int_Array_0[0] + signed_long_int_Array_0[1][0]) > (last_1_unsigned_long_int_Array_0_0_ * signed_short_int_Array_0[0])) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[0])) : (unsigned_long_int_Array_0[0] == ((unsigned long int) signed_long_int_Array_0[0][0]))) : 1) : 1)) && (signed_long_int_Array_0[0][1] == ((signed long int) signed_short_int_Array_0[0]))) && (signed_short_int_Array_0[0] == ((signed short int) unsigned_char_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L102-L103] return (((((float_Array_0[0][1] <= (- float_Array_0[1][0])) ? (float_Array_0[1][1] == ((float) ((((float_Array_0[0][0]) < 0 ) ? -(float_Array_0[0][0]) : (float_Array_0[0][0]))))) : (BOOL_unsigned_char_Array_0[1] ? (float_Array_0[1][1] == ((float) float_Array_0[0][0])) : (float_Array_0[1][1] == ((float) float_Array_0[0][0])))) && ((BOOL_unsigned_char_Array_0[1] || BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[1][1] == ((signed long int) ((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[0])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[0]))))) : (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][0] + signed_long_int_Array_0[1][0]) - 4))))) && (((signed_long_int_Array_0[1][0] << signed_short_int_Array_0[0]) != ((((signed_long_int_Array_0[0][0]) < 0 ) ? -(signed_long_int_Array_0[0][0]) : (signed_long_int_Array_0[0][0])))) ? (((signed_short_int_Array_0[0] % unsigned_char_Array_0[0]) >= signed_long_int_Array_0[1][0]) ? (((signed_short_int_Array_0[0] + signed_long_int_Array_0[1][0]) > (last_1_unsigned_long_int_Array_0_0_ * signed_short_int_Array_0[0])) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[0])) : (unsigned_long_int_Array_0[0] == ((unsigned long int) signed_long_int_Array_0[0][0]))) : 1) : 1)) && (signed_long_int_Array_0[0][1] == ((signed long int) signed_short_int_Array_0[0]))) && (signed_short_int_Array_0[0] == ((signed short int) unsigned_char_Array_0[0])) ; [L112] RET, EXPR property() [L112] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_0_=16, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 112 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.4s, OverallIterations: 6, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 708 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 700 mSDsluCounter, 2883 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2073 mSDsCounter, 66 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 569 IncrementalHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 66 mSolverCounterUnsat, 810 mSDtfsCounter, 569 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 446 GetRequests, 408 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=256occurred in iteration=5, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 16 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 889 NumberOfCodeBlocks, 889 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 882 ConstructedInterpolants, 0 QuantifiedInterpolants, 1764 SizeOfPredicates, 4 NumberOfNonLiveVariables, 450 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 2494/2548 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-11-10 09:11:25,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-1.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 e5e12694fa2cc5566bc8c3de95aa8f90b8dcd04904e4595c1a38d5095b0a77e4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 09:11:27,235 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 09:11:27,312 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 09:11:27,322 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 09:11:27,322 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 09:11:27,357 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 09:11:27,358 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 09:11:27,358 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 09:11:27,359 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 09:11:27,360 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 09:11:27,361 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 09:11:27,361 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 09:11:27,362 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 09:11:27,362 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 09:11:27,363 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 09:11:27,366 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 09:11:27,366 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 09:11:27,367 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 09:11:27,367 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 09:11:27,367 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 09:11:27,367 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 09:11:27,368 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 09:11:27,369 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 09:11:27,369 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 09:11:27,370 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 09:11:27,370 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 09:11:27,370 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 09:11:27,371 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 09:11:27,371 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 09:11:27,371 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 09:11:27,371 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 09:11:27,372 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 09:11:27,372 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 09:11:27,373 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 09:11:27,374 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:11:27,374 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 09:11:27,375 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 09:11:27,375 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 09:11:27,375 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 09:11:27,376 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 09:11:27,376 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 09:11:27,376 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 09:11:27,376 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 09:11:27,377 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 09:11:27,377 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 -> e5e12694fa2cc5566bc8c3de95aa8f90b8dcd04904e4595c1a38d5095b0a77e4 [2024-11-10 09:11:27,741 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 09:11:27,768 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 09:11:27,772 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 09:11:27,773 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 09:11:27,773 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 09:11:27,775 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-1.i [2024-11-10 09:11:29,337 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 09:11:29,575 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 09:11:29,576 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-1.i [2024-11-10 09:11:29,594 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1890bf86/7ee10c47dee84ab89677806dff55848a/FLAG65c399577 [2024-11-10 09:11:29,612 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1890bf86/7ee10c47dee84ab89677806dff55848a [2024-11-10 09:11:29,617 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 09:11:29,619 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 09:11:29,621 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 09:11:29,622 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 09:11:29,629 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 09:11:29,629 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:11:29" (1/1) ... [2024-11-10 09:11:29,630 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1703e910 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:11:29, skipping insertion in model container [2024-11-10 09:11:29,630 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:11:29" (1/1) ... [2024-11-10 09:11:29,659 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 09:11:29,846 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-1.i[915,928] [2024-11-10 09:11:29,943 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:11:29,967 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 09:11:29,982 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-1.i[915,928] [2024-11-10 09:11:30,041 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:11:30,068 INFO L204 MainTranslator]: Completed translation [2024-11-10 09:11:30,069 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:11:30 WrapperNode [2024-11-10 09:11:30,069 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 09:11:30,070 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 09:11:30,070 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 09:11:30,070 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 09:11:30,077 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:11:30" (1/1) ... [2024-11-10 09:11:30,099 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:11:30" (1/1) ... [2024-11-10 09:11:30,139 INFO L138 Inliner]: procedures = 36, calls = 158, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 476 [2024-11-10 09:11:30,142 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 09:11:30,143 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 09:11:30,143 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 09:11:30,143 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 09:11:30,160 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:11:30" (1/1) ... [2024-11-10 09:11:30,160 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:11:30" (1/1) ... [2024-11-10 09:11:30,171 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:11:30" (1/1) ... [2024-11-10 09:11:30,209 INFO L175 MemorySlicer]: Split 127 memory accesses to 7 slices as follows [2, 14, 39, 34, 21, 11, 6]. 31 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 2, 4, 4, 1, 1, 1]. The 17 writes are split as follows [0, 2, 6, 5, 1, 1, 2]. [2024-11-10 09:11:30,213 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:11:30" (1/1) ... [2024-11-10 09:11:30,213 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:11:30" (1/1) ... [2024-11-10 09:11:30,260 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:11:30" (1/1) ... [2024-11-10 09:11:30,261 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:11:30" (1/1) ... [2024-11-10 09:11:30,271 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:11:30" (1/1) ... [2024-11-10 09:11:30,277 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:11:30" (1/1) ... [2024-11-10 09:11:30,288 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 09:11:30,293 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 09:11:30,293 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 09:11:30,293 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 09:11:30,294 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:11:30" (1/1) ... [2024-11-10 09:11:30,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:11:30,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:11:30,328 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-11-10 09:11:30,331 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-11-10 09:11:30,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 09:11:30,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-10 09:11:30,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-10 09:11:30,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-10 09:11:30,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-10 09:11:30,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-10 09:11:30,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-10 09:11:30,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-11-10 09:11:30,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-10 09:11:30,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-10 09:11:30,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-10 09:11:30,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-10 09:11:30,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-10 09:11:30,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-10 09:11:30,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-11-10 09:11:30,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 09:11:30,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-10 09:11:30,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-10 09:11:30,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-10 09:11:30,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-10 09:11:30,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-10 09:11:30,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-10 09:11:30,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-10 09:11:30,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-10 09:11:30,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-10 09:11:30,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-10 09:11:30,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-10 09:11:30,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-10 09:11:30,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-11-10 09:11:30,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-10 09:11:30,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-10 09:11:30,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-10 09:11:30,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-10 09:11:30,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-10 09:11:30,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-10 09:11:30,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-11-10 09:11:30,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-10 09:11:30,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-10 09:11:30,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-10 09:11:30,391 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-10 09:11:30,391 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-10 09:11:30,391 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-10 09:11:30,391 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-11-10 09:11:30,391 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-10 09:11:30,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-10 09:11:30,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-10 09:11:30,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-10 09:11:30,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-10 09:11:30,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-11-10 09:11:30,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-11-10 09:11:30,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-10 09:11:30,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-10 09:11:30,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-10 09:11:30,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-10 09:11:30,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-10 09:11:30,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-10 09:11:30,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-11-10 09:11:30,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-10 09:11:30,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-10 09:11:30,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-10 09:11:30,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-10 09:11:30,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-10 09:11:30,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-11-10 09:11:30,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-11-10 09:11:30,395 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 09:11:30,395 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 09:11:30,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 09:11:30,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 09:11:30,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-10 09:11:30,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-10 09:11:30,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-10 09:11:30,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-10 09:11:30,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-10 09:11:30,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-10 09:11:30,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-11-10 09:11:30,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-10 09:11:30,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-10 09:11:30,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-10 09:11:30,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-10 09:11:30,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-10 09:11:30,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-11-10 09:11:30,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-11-10 09:11:30,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-10 09:11:30,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-10 09:11:30,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-10 09:11:30,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-10 09:11:30,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-10 09:11:30,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-10 09:11:30,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-11-10 09:11:30,594 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 09:11:30,595 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 09:11:31,214 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L102: havoc property_#t~mem80#1;havoc property_#t~mem79#1;havoc property_#t~ite92#1;havoc property_#t~mem85#1;havoc property_#t~mem81#1;havoc property_#t~ite84#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~mem86#1;havoc property_#t~ite91#1;havoc property_#t~mem88#1;havoc property_#t~mem87#1;havoc property_#t~mem90#1;havoc property_#t~mem89#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~short95#1;havoc property_#t~ite105#1;havoc property_#t~mem101#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~ite100#1;havoc property_#t~mem98#1;havoc property_#t~mem99#1;havoc property_#t~mem104#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~short106#1;havoc property_#t~mem107#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~ite112#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~ite125#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~ite124#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~mem118#1;havoc property_#t~ite123#1;havoc property_#t~mem120#1;havoc property_#t~mem119#1;havoc property_#t~mem122#1;havoc property_#t~mem121#1;havoc property_#t~short126#1;havoc property_#t~mem128#1;havoc property_#t~mem127#1;havoc property_#t~short129#1;havoc property_#t~mem131#1;havoc property_#t~mem130#1;havoc property_#t~short132#1; [2024-11-10 09:11:31,267 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2024-11-10 09:11:31,267 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 09:11:31,284 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 09:11:31,285 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 09:11:31,285 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:11:31 BoogieIcfgContainer [2024-11-10 09:11:31,285 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 09:11:31,288 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 09:11:31,288 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 09:11:31,291 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 09:11:31,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:11:29" (1/3) ... [2024-11-10 09:11:31,292 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57573c39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:11:31, skipping insertion in model container [2024-11-10 09:11:31,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:11:30" (2/3) ... [2024-11-10 09:11:31,293 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57573c39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:11:31, skipping insertion in model container [2024-11-10 09:11:31,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:11:31" (3/3) ... [2024-11-10 09:11:31,295 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-1.i [2024-11-10 09:11:31,311 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 09:11:31,311 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 09:11:31,360 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 09:11:31,366 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;@58d5424a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 09:11:31,366 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 09:11:31,369 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 89 states have (on average 1.4157303370786516) internal successors, (126), 90 states have internal predecessors, (126), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-10 09:11:31,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-10 09:11:31,381 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:11:31,381 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:11:31,382 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:11:31,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:11:31,386 INFO L85 PathProgramCache]: Analyzing trace with hash -775462751, now seen corresponding path program 1 times [2024-11-10 09:11:31,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:11:31,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2089021635] [2024-11-10 09:11:31,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:11:31,399 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-11-10 09:11:31,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:11:31,402 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-11-10 09:11:31,404 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-11-10 09:11:31,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:31,792 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 09:11:31,801 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:11:31,851 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2024-11-10 09:11:31,851 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:11:31,852 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:11:31,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2089021635] [2024-11-10 09:11:31,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2089021635] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:11:31,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:11:31,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 09:11:31,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060455878] [2024-11-10 09:11:31,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:11:31,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 09:11:31,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:11:31,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 09:11:31,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:11:31,888 INFO L87 Difference]: Start difference. First operand has 106 states, 89 states have (on average 1.4157303370786516) internal successors, (126), 90 states have internal predecessors, (126), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-10 09:11:31,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:11:31,926 INFO L93 Difference]: Finished difference Result 204 states and 315 transitions. [2024-11-10 09:11:31,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 09:11:31,931 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 125 [2024-11-10 09:11:31,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:11:31,941 INFO L225 Difference]: With dead ends: 204 [2024-11-10 09:11:31,941 INFO L226 Difference]: Without dead ends: 101 [2024-11-10 09:11:31,946 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:11:31,951 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:11:31,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:11:31,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-10 09:11:31,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-10 09:11:32,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 85 states have (on average 1.388235294117647) internal successors, (118), 85 states have internal predecessors, (118), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-10 09:11:32,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 146 transitions. [2024-11-10 09:11:32,007 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 146 transitions. Word has length 125 [2024-11-10 09:11:32,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:11:32,007 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 146 transitions. [2024-11-10 09:11:32,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-10 09:11:32,008 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 146 transitions. [2024-11-10 09:11:32,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-10 09:11:32,014 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:11:32,014 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:11:32,029 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-11-10 09:11:32,215 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-11-10 09:11:32,216 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:11:32,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:11:32,216 INFO L85 PathProgramCache]: Analyzing trace with hash -356616643, now seen corresponding path program 1 times [2024-11-10 09:11:32,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:11:32,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [954519930] [2024-11-10 09:11:32,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:11:32,218 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-11-10 09:11:32,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:11:32,221 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-11-10 09:11:32,222 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-11-10 09:11:32,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:32,579 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 09:11:32,585 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:11:32,651 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 09:11:32,651 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:11:32,651 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:11:32,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [954519930] [2024-11-10 09:11:32,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [954519930] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:11:32,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:11:32,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:11:32,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999318511] [2024-11-10 09:11:32,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:11:32,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:11:32,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:11:32,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:11:32,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:11:32,658 INFO L87 Difference]: Start difference. First operand 101 states and 146 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 09:11:32,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:11:32,742 INFO L93 Difference]: Finished difference Result 204 states and 296 transitions. [2024-11-10 09:11:32,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:11:32,743 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 125 [2024-11-10 09:11:32,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:11:32,745 INFO L225 Difference]: With dead ends: 204 [2024-11-10 09:11:32,745 INFO L226 Difference]: Without dead ends: 106 [2024-11-10 09:11:32,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:11:32,747 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 1 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:11:32,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 548 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:11:32,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-10 09:11:32,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2024-11-10 09:11:32,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 89 states have (on average 1.3707865168539326) internal successors, (122), 89 states have internal predecessors, (122), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-10 09:11:32,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 150 transitions. [2024-11-10 09:11:32,759 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 150 transitions. Word has length 125 [2024-11-10 09:11:32,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:11:32,763 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 150 transitions. [2024-11-10 09:11:32,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 09:11:32,763 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 150 transitions. [2024-11-10 09:11:32,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-10 09:11:32,765 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:11:32,765 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:11:32,776 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-11-10 09:11:32,965 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-11-10 09:11:32,966 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:11:32,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:11:32,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1386193692, now seen corresponding path program 1 times [2024-11-10 09:11:32,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:11:32,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1774321857] [2024-11-10 09:11:32,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:11:32,968 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-11-10 09:11:32,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:11:32,971 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-11-10 09:11:32,972 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-11-10 09:11:33,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:33,283 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 09:11:33,290 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:11:33,336 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 09:11:33,337 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:11:33,337 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:11:33,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1774321857] [2024-11-10 09:11:33,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1774321857] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:11:33,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:11:33,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 09:11:33,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876468311] [2024-11-10 09:11:33,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:11:33,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:11:33,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:11:33,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:11:33,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:11:33,343 INFO L87 Difference]: Start difference. First operand 105 states and 150 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 09:11:33,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:11:33,415 INFO L93 Difference]: Finished difference Result 210 states and 301 transitions. [2024-11-10 09:11:33,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:11:33,428 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 125 [2024-11-10 09:11:33,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:11:33,432 INFO L225 Difference]: With dead ends: 210 [2024-11-10 09:11:33,435 INFO L226 Difference]: Without dead ends: 108 [2024-11-10 09:11:33,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:11:33,441 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 1 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:11:33,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 679 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:11:33,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-10 09:11:33,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2024-11-10 09:11:33,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 91 states have (on average 1.3626373626373627) internal successors, (124), 91 states have internal predecessors, (124), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-10 09:11:33,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 152 transitions. [2024-11-10 09:11:33,461 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 152 transitions. Word has length 125 [2024-11-10 09:11:33,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:11:33,462 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 152 transitions. [2024-11-10 09:11:33,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 09:11:33,463 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 152 transitions. [2024-11-10 09:11:33,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-10 09:11:33,468 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:11:33,468 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:11:33,495 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-11-10 09:11:33,669 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-11-10 09:11:33,670 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:11:33,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:11:33,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1414822843, now seen corresponding path program 1 times [2024-11-10 09:11:33,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:11:33,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1145649935] [2024-11-10 09:11:33,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:11:33,671 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-11-10 09:11:33,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:11:33,675 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-11-10 09:11:33,675 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-11-10 09:11:33,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:33,961 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-10 09:11:33,967 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:11:34,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-10 09:11:34,078 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 27 treesize of output 11 [2024-11-10 09:11:34,164 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:11:34,166 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 34 treesize of output 33 [2024-11-10 09:11:34,232 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:11:34,232 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 38 treesize of output 14 [2024-11-10 09:11:34,251 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 195 proven. 18 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2024-11-10 09:11:34,251 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 09:11:34,476 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 21 proven. 18 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-10 09:11:34,477 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:11:34,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1145649935] [2024-11-10 09:11:34,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1145649935] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 09:11:34,477 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 09:11:34,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2024-11-10 09:11:34,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533858433] [2024-11-10 09:11:34,478 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 09:11:34,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 09:11:34,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:11:34,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 09:11:34,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-10 09:11:34,481 INFO L87 Difference]: Start difference. First operand 107 states and 152 transitions. Second operand has 11 states, 9 states have (on average 7.777777777777778) internal successors, (70), 11 states have internal predecessors, (70), 4 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (21), 2 states have call predecessors, (21), 4 states have call successors, (21) [2024-11-10 09:11:35,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:11:35,263 INFO L93 Difference]: Finished difference Result 300 states and 422 transitions. [2024-11-10 09:11:35,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 09:11:35,265 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 7.777777777777778) internal successors, (70), 11 states have internal predecessors, (70), 4 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (21), 2 states have call predecessors, (21), 4 states have call successors, (21) Word has length 125 [2024-11-10 09:11:35,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:11:35,267 INFO L225 Difference]: With dead ends: 300 [2024-11-10 09:11:35,267 INFO L226 Difference]: Without dead ends: 196 [2024-11-10 09:11:35,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 238 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2024-11-10 09:11:35,270 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 304 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 09:11:35,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 780 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 09:11:35,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-10 09:11:35,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 188. [2024-11-10 09:11:35,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 163 states have (on average 1.361963190184049) internal successors, (222), 164 states have internal predecessors, (222), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-10 09:11:35,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 264 transitions. [2024-11-10 09:11:35,288 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 264 transitions. Word has length 125 [2024-11-10 09:11:35,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:11:35,288 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 264 transitions. [2024-11-10 09:11:35,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 7.777777777777778) internal successors, (70), 11 states have internal predecessors, (70), 4 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (21), 2 states have call predecessors, (21), 4 states have call successors, (21) [2024-11-10 09:11:35,289 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 264 transitions. [2024-11-10 09:11:35,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-10 09:11:35,290 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:11:35,291 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:11:35,305 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-11-10 09:11:35,491 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-11-10 09:11:35,492 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:11:35,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:11:35,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1005998618, now seen corresponding path program 1 times [2024-11-10 09:11:35,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:11:35,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1690957964] [2024-11-10 09:11:35,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:11:35,493 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-11-10 09:11:35,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:11:35,497 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-11-10 09:11:35,498 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-11-10 09:11:35,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:35,844 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-10 09:11:35,850 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:11:35,996 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-11-10 09:11:36,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 34 [2024-11-10 09:11:37,336 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:11:37,337 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-11-10 09:11:37,435 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 20 proven. 192 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2024-11-10 09:11:37,435 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 09:11:38,140 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:11:38,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1690957964] [2024-11-10 09:11:38,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1690957964] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 09:11:38,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [146669560] [2024-11-10 09:11:38,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:11:38,142 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-10 09:11:38,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-10 09:11:38,146 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-10 09:11:38,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-11-10 09:11:38,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:38,984 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-10 09:11:38,990 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:11:39,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 09:11:39,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2024-11-10 09:11:40,976 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:11:40,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 139 treesize of output 67 [2024-11-10 09:11:41,035 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 20 proven. 192 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2024-11-10 09:11:41,035 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 09:11:41,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [146669560] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 09:11:41,361 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 09:11:41,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2024-11-10 09:11:41,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058995035] [2024-11-10 09:11:41,361 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 09:11:41,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-10 09:11:41,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:11:41,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-10 09:11:41,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=588, Unknown=0, NotChecked=0, Total=702 [2024-11-10 09:11:41,363 INFO L87 Difference]: Start difference. First operand 188 states and 264 transitions. Second operand has 21 states, 21 states have (on average 4.904761904761905) internal successors, (103), 20 states have internal predecessors, (103), 6 states have call successors, (28), 6 states have call predecessors, (28), 6 states have return successors, (28), 6 states have call predecessors, (28), 6 states have call successors, (28) [2024-11-10 09:11:43,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:11:43,427 INFO L93 Difference]: Finished difference Result 716 states and 1003 transitions. [2024-11-10 09:11:43,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 09:11:43,428 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.904761904761905) internal successors, (103), 20 states have internal predecessors, (103), 6 states have call successors, (28), 6 states have call predecessors, (28), 6 states have return successors, (28), 6 states have call predecessors, (28), 6 states have call successors, (28) Word has length 125 [2024-11-10 09:11:43,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:11:43,435 INFO L225 Difference]: With dead ends: 716 [2024-11-10 09:11:43,435 INFO L226 Difference]: Without dead ends: 531 [2024-11-10 09:11:43,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 378 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=192, Invalid=864, Unknown=0, NotChecked=0, Total=1056 [2024-11-10 09:11:43,441 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 704 mSDsluCounter, 1287 mSDsCounter, 0 mSdLazyCounter, 946 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 1426 SdHoareTripleChecker+Invalid, 1070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-10 09:11:43,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [704 Valid, 1426 Invalid, 1070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 946 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-10 09:11:43,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2024-11-10 09:11:43,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 521. [2024-11-10 09:11:43,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 450 states have (on average 1.3577777777777778) internal successors, (611), 457 states have internal predecessors, (611), 61 states have call successors, (61), 9 states have call predecessors, (61), 9 states have return successors, (61), 54 states have call predecessors, (61), 61 states have call successors, (61) [2024-11-10 09:11:43,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 733 transitions. [2024-11-10 09:11:43,494 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 733 transitions. Word has length 125 [2024-11-10 09:11:43,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:11:43,495 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 733 transitions. [2024-11-10 09:11:43,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.904761904761905) internal successors, (103), 20 states have internal predecessors, (103), 6 states have call successors, (28), 6 states have call predecessors, (28), 6 states have return successors, (28), 6 states have call predecessors, (28), 6 states have call successors, (28) [2024-11-10 09:11:43,496 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 733 transitions. [2024-11-10 09:11:43,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-10 09:11:43,499 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:11:43,499 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:11:43,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2024-11-10 09:11:43,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-10 09:11:43,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-11-10 09:11:43,901 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:11:43,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:11:43,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1019531419, now seen corresponding path program 1 times [2024-11-10 09:11:43,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:11:43,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [844852048] [2024-11-10 09:11:43,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:11:43,902 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-11-10 09:11:43,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:11:43,905 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-11-10 09:11:43,906 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-11-10 09:11:44,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:44,150 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 09:11:44,154 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:11:44,165 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-11-10 09:11:44,165 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:11:44,166 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:11:44,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [844852048] [2024-11-10 09:11:44,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [844852048] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:11:44,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:11:44,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:11:44,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660174965] [2024-11-10 09:11:44,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:11:44,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:11:44,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:11:44,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:11:44,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:11:44,168 INFO L87 Difference]: Start difference. First operand 521 states and 733 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-10 09:11:44,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:11:44,215 INFO L93 Difference]: Finished difference Result 1043 states and 1469 transitions. [2024-11-10 09:11:44,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:11:44,217 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 125 [2024-11-10 09:11:44,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:11:44,223 INFO L225 Difference]: With dead ends: 1043 [2024-11-10 09:11:44,224 INFO L226 Difference]: Without dead ends: 525 [2024-11-10 09:11:44,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 122 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-11-10 09:11:44,226 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:11:44,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 421 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:11:44,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2024-11-10 09:11:44,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 525. [2024-11-10 09:11:44,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 454 states have (on average 1.3502202643171806) internal successors, (613), 461 states have internal predecessors, (613), 61 states have call successors, (61), 9 states have call predecessors, (61), 9 states have return successors, (61), 54 states have call predecessors, (61), 61 states have call successors, (61) [2024-11-10 09:11:44,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 735 transitions. [2024-11-10 09:11:44,269 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 735 transitions. Word has length 125 [2024-11-10 09:11:44,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:11:44,270 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 735 transitions. [2024-11-10 09:11:44,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-10 09:11:44,270 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 735 transitions. [2024-11-10 09:11:44,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-10 09:11:44,272 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:11:44,272 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:11:44,283 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-11-10 09:11:44,472 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-11-10 09:11:44,473 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:11:44,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:11:44,474 INFO L85 PathProgramCache]: Analyzing trace with hash -2120772423, now seen corresponding path program 1 times [2024-11-10 09:11:44,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:11:44,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1950642684] [2024-11-10 09:11:44,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:11:44,474 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-11-10 09:11:44,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:11:44,476 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-11-10 09:11:44,477 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-11-10 09:11:44,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:44,685 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 09:11:44,687 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:11:44,697 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-10 09:11:44,697 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:11:44,697 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:11:44,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1950642684] [2024-11-10 09:11:44,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1950642684] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:11:44,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:11:44,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:11:44,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625777265] [2024-11-10 09:11:44,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:11:44,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:11:44,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:11:44,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:11:44,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:11:44,700 INFO L87 Difference]: Start difference. First operand 525 states and 735 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-10 09:11:44,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:11:44,768 INFO L93 Difference]: Finished difference Result 1047 states and 1467 transitions. [2024-11-10 09:11:44,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:11:44,769 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 125 [2024-11-10 09:11:44,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:11:44,772 INFO L225 Difference]: With dead ends: 1047 [2024-11-10 09:11:44,772 INFO L226 Difference]: Without dead ends: 525 [2024-11-10 09:11:44,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 122 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-11-10 09:11:44,774 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:11:44,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 421 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:11:44,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2024-11-10 09:11:44,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 525. [2024-11-10 09:11:44,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 454 states have (on average 1.3458149779735682) internal successors, (611), 461 states have internal predecessors, (611), 61 states have call successors, (61), 9 states have call predecessors, (61), 9 states have return successors, (61), 54 states have call predecessors, (61), 61 states have call successors, (61) [2024-11-10 09:11:44,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 733 transitions. [2024-11-10 09:11:44,814 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 733 transitions. Word has length 125 [2024-11-10 09:11:44,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:11:44,814 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 733 transitions. [2024-11-10 09:11:44,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-10 09:11:44,815 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 733 transitions. [2024-11-10 09:11:44,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-10 09:11:44,817 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:11:44,817 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:11:44,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-10 09:11:45,017 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-11-10 09:11:45,018 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:11:45,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:11:45,019 INFO L85 PathProgramCache]: Analyzing trace with hash -326730884, now seen corresponding path program 1 times [2024-11-10 09:11:45,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:11:45,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [991806287] [2024-11-10 09:11:45,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:11:45,020 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:11:45,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:11:45,021 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-11-10 09:11:45,022 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-11-10 09:11:45,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:11:45,286 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-10 09:11:45,290 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:11:45,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 09:11:45,504 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 68 treesize of output 32 [2024-11-10 09:11:45,568 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 68 treesize of output 32 [2024-11-10 09:11:46,054 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 114 treesize of output 66 [2024-11-10 09:11:46,242 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:11:46,242 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 167 treesize of output 71 [2024-11-10 09:12:00,327 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-11-10 09:12:00,328 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:12:00,328 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:12:00,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [991806287] [2024-11-10 09:12:00,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [991806287] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:12:00,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:12:00,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-10 09:12:00,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524904006] [2024-11-10 09:12:00,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:12:00,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 09:12:00,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:12:00,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 09:12:00,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=141, Unknown=3, NotChecked=0, Total=182 [2024-11-10 09:12:00,330 INFO L87 Difference]: Start difference. First operand 525 states and 733 transitions. Second operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 13 states have internal predecessors, (62), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-10 09:12:05,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 09:12:09,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 09:12:15,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 09:12:20,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 09:12:24,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 09:12:29,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 09:12:34,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 09:12:39,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 09:12:44,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]