./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-9.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d 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-p_file-9.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 aa8cc58df8fe09b61997a2de9d9c5e7a83d2492c15b287abd5439e2c29784fc7 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:57:40,836 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:57:40,891 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 01:57:40,895 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:57:40,896 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:57:40,917 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:57:40,918 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:57:40,918 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:57:40,919 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:57:40,920 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:57:40,921 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:57:40,921 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:57:40,922 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:57:40,924 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:57:40,924 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:57:40,924 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:57:40,925 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:57:40,925 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:57:40,925 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 01:57:40,926 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:57:40,926 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:57:40,930 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:57:40,930 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:57:40,930 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:57:40,930 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:57:40,931 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:57:40,931 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:57:40,931 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:57:40,931 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:57:40,932 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:57:40,932 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:57:40,932 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:57:40,932 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:57:40,933 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:57:40,933 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:57:40,933 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:57:40,933 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 01:57:40,933 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 01:57:40,934 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:57:40,934 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:57:40,934 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:57:40,936 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:57:40,936 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 -> aa8cc58df8fe09b61997a2de9d9c5e7a83d2492c15b287abd5439e2c29784fc7 [2024-11-09 01:57:41,195 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:57:41,222 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:57:41,226 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:57:41,228 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:57:41,228 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:57:41,229 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-9.i [2024-11-09 01:57:42,659 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:57:42,859 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:57:42,860 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-9.i [2024-11-09 01:57:42,871 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85f6fca7f/be5f20b6ca5c45158081a89cf15ebc96/FLAG1ad46a10e [2024-11-09 01:57:42,884 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85f6fca7f/be5f20b6ca5c45158081a89cf15ebc96 [2024-11-09 01:57:42,887 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:57:42,889 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:57:42,893 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:57:42,893 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:57:42,899 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:57:42,901 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:57:42" (1/1) ... [2024-11-09 01:57:42,902 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@389f075 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:57:42, skipping insertion in model container [2024-11-09 01:57:42,902 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:57:42" (1/1) ... [2024-11-09 01:57:42,930 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:57:43,088 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-p_file-9.i[915,928] [2024-11-09 01:57:43,133 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:57:43,144 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:57:43,155 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-p_file-9.i[915,928] [2024-11-09 01:57:43,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:57:43,195 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:57:43,195 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:57:43 WrapperNode [2024-11-09 01:57:43,196 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:57:43,197 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:57:43,197 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:57:43,197 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:57:43,204 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:57:43" (1/1) ... [2024-11-09 01:57:43,216 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:57:43" (1/1) ... [2024-11-09 01:57:43,258 INFO L138 Inliner]: procedures = 29, calls = 111, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 367 [2024-11-09 01:57:43,259 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:57:43,259 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:57:43,259 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:57:43,260 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:57:43,298 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:57:43" (1/1) ... [2024-11-09 01:57:43,298 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:57:43" (1/1) ... [2024-11-09 01:57:43,308 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:57:43" (1/1) ... [2024-11-09 01:57:43,377 INFO L175 MemorySlicer]: Split 86 memory accesses to 10 slices as follows [2, 10, 18, 6, 3, 3, 14, 8, 14, 8]. 21 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 13 writes are split as follows [0, 4, 1, 1, 1, 1, 1, 1, 2, 1]. [2024-11-09 01:57:43,381 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:57:43" (1/1) ... [2024-11-09 01:57:43,381 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:57:43" (1/1) ... [2024-11-09 01:57:43,403 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:57:43" (1/1) ... [2024-11-09 01:57:43,411 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:57:43" (1/1) ... [2024-11-09 01:57:43,418 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:57:43" (1/1) ... [2024-11-09 01:57:43,421 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:57:43" (1/1) ... [2024-11-09 01:57:43,427 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:57:43,432 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:57:43,436 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:57:43,436 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:57:43,437 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:57:43" (1/1) ... [2024-11-09 01:57:43,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:57:43,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:57:43,477 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-09 01:57:43,481 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-09 01:57:43,534 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:57:43,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-09 01:57:43,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-09 01:57:43,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-09 01:57:43,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-09 01:57:43,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-09 01:57:43,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-09 01:57:43,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-11-09 01:57:43,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-11-09 01:57:43,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2024-11-09 01:57:43,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2024-11-09 01:57:43,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 01:57:43,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 01:57:43,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 01:57:43,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-09 01:57:43,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-09 01:57:43,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-09 01:57:43,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-09 01:57:43,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-09 01:57:43,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-11-09 01:57:43,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-11-09 01:57:43,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-09 01:57:43,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-09 01:57:43,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-09 01:57:43,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-09 01:57:43,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-09 01:57:43,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-09 01:57:43,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-11-09 01:57:43,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-11-09 01:57:43,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2024-11-09 01:57:43,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2024-11-09 01:57:43,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 01:57:43,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 01:57:43,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 01:57:43,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-09 01:57:43,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-09 01:57:43,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-09 01:57:43,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-09 01:57:43,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-09 01:57:43,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-11-09 01:57:43,544 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-11-09 01:57:43,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-09 01:57:43,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-09 01:57:43,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-09 01:57:43,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-09 01:57:43,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-09 01:57:43,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-09 01:57:43,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-11-09 01:57:43,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-11-09 01:57:43,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2024-11-09 01:57:43,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2024-11-09 01:57:43,546 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:57:43,546 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:57:43,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 01:57:43,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 01:57:43,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 01:57:43,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-09 01:57:43,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-09 01:57:43,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-09 01:57:43,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-09 01:57:43,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-09 01:57:43,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-09 01:57:43,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-09 01:57:43,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:57:43,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:57:43,730 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:57:43,732 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:57:44,203 INFO L? ?]: Removed 81 outVars from TransFormulas that were not future-live. [2024-11-09 01:57:44,203 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:57:44,216 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:57:44,217 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:57:44,217 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:57:44 BoogieIcfgContainer [2024-11-09 01:57:44,217 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:57:44,219 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:57:44,220 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:57:44,223 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:57:44,224 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:57:42" (1/3) ... [2024-11-09 01:57:44,225 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7572ce9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:57:44, skipping insertion in model container [2024-11-09 01:57:44,225 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:57:43" (2/3) ... [2024-11-09 01:57:44,225 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7572ce9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:57:44, skipping insertion in model container [2024-11-09 01:57:44,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:57:44" (3/3) ... [2024-11-09 01:57:44,227 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-9.i [2024-11-09 01:57:44,242 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:57:44,242 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:57:44,298 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:57:44,305 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;@799193a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:57:44,306 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:57:44,310 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 69 states have internal predecessors, (97), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 01:57:44,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-09 01:57:44,319 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:57:44,320 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:57:44,320 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:57:44,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:57:44,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1156031742, now seen corresponding path program 1 times [2024-11-09 01:57:44,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:57:44,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759864271] [2024-11-09 01:57:44,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:57:44,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:57:44,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:57:44,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:57:44,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:57:44,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:57:44,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:57:44,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:57:44,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:57:44,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:57:44,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:57:44,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:57:44,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:57:44,678 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 01:57:44,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:57:44,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759864271] [2024-11-09 01:57:44,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759864271] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:57:44,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:57:44,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:57:44,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518229835] [2024-11-09 01:57:44,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:57:44,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:57:44,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:57:44,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:57:44,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:57:44,716 INFO L87 Difference]: Start difference. First operand has 76 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 69 states have internal predecessors, (97), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 01:57:44,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:57:44,738 INFO L93 Difference]: Finished difference Result 145 states and 213 transitions. [2024-11-09 01:57:44,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:57:44,740 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 62 [2024-11-09 01:57:44,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:57:44,747 INFO L225 Difference]: With dead ends: 145 [2024-11-09 01:57:44,748 INFO L226 Difference]: Without dead ends: 72 [2024-11-09 01:57:44,750 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 17 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-09 01:57:44,754 INFO L432 NwaCegarLoop]: 100 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, 100 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-09 01:57:44,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:57:44,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-09 01:57:44,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-09 01:57:44,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 65 states have (on average 1.3846153846153846) internal successors, (90), 65 states have internal predecessors, (90), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 01:57:44,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 100 transitions. [2024-11-09 01:57:44,790 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 100 transitions. Word has length 62 [2024-11-09 01:57:44,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:57:44,791 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 100 transitions. [2024-11-09 01:57:44,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 01:57:44,791 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 100 transitions. [2024-11-09 01:57:44,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-09 01:57:44,794 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:57:44,794 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:57:44,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 01:57:44,795 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:57:44,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:57:44,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1779963588, now seen corresponding path program 1 times [2024-11-09 01:57:44,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:57:44,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985012284] [2024-11-09 01:57:44,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:57:44,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:57:44,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:57:45,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:57:45,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:57:45,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:57:45,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:57:45,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:57:45,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:57:45,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:57:45,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:57:45,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:57:45,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:57:45,137 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 01:57:45,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:57:45,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985012284] [2024-11-09 01:57:45,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985012284] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:57:45,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:57:45,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:57:45,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078419268] [2024-11-09 01:57:45,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:57:45,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:57:45,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:57:45,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:57:45,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:57:45,148 INFO L87 Difference]: Start difference. First operand 72 states and 100 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 01:57:45,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:57:45,197 INFO L93 Difference]: Finished difference Result 144 states and 201 transitions. [2024-11-09 01:57:45,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:57:45,202 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 62 [2024-11-09 01:57:45,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:57:45,207 INFO L225 Difference]: With dead ends: 144 [2024-11-09 01:57:45,207 INFO L226 Difference]: Without dead ends: 75 [2024-11-09 01:57:45,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 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-09 01:57:45,209 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 1 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:57:45,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 280 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:57:45,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-09 01:57:45,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2024-11-09 01:57:45,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 67 states have (on average 1.373134328358209) internal successors, (92), 67 states have internal predecessors, (92), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 01:57:45,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 102 transitions. [2024-11-09 01:57:45,227 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 102 transitions. Word has length 62 [2024-11-09 01:57:45,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:57:45,229 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 102 transitions. [2024-11-09 01:57:45,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 01:57:45,229 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 102 transitions. [2024-11-09 01:57:45,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-09 01:57:45,231 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:57:45,231 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:57:45,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 01:57:45,231 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:57:45,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:57:45,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1813939130, now seen corresponding path program 1 times [2024-11-09 01:57:45,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:57:45,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888661226] [2024-11-09 01:57:45,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:57:45,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:57:45,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:57:45,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:57:45,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:57:45,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:57:45,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:57:45,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:57:45,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:57:45,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:57:45,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:57:45,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:57:45,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:57:45,635 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 01:57:45,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:57:45,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888661226] [2024-11-09 01:57:45,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888661226] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:57:45,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:57:45,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 01:57:45,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122973926] [2024-11-09 01:57:45,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:57:45,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 01:57:45,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:57:45,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 01:57:45,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:57:45,642 INFO L87 Difference]: Start difference. First operand 74 states and 102 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 01:57:45,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:57:45,886 INFO L93 Difference]: Finished difference Result 263 states and 366 transitions. [2024-11-09 01:57:45,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:57:45,887 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 62 [2024-11-09 01:57:45,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:57:45,889 INFO L225 Difference]: With dead ends: 263 [2024-11-09 01:57:45,889 INFO L226 Difference]: Without dead ends: 192 [2024-11-09 01:57:45,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:57:45,892 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 319 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:57:45,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 503 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:57:45,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-11-09 01:57:45,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 141. [2024-11-09 01:57:45,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 128 states have (on average 1.375) internal successors, (176), 128 states have internal predecessors, (176), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 01:57:45,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 196 transitions. [2024-11-09 01:57:45,925 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 196 transitions. Word has length 62 [2024-11-09 01:57:45,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:57:45,927 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 196 transitions. [2024-11-09 01:57:45,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 01:57:45,928 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 196 transitions. [2024-11-09 01:57:45,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-09 01:57:45,932 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:57:45,932 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:57:45,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 01:57:45,932 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:57:45,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:57:45,933 INFO L85 PathProgramCache]: Analyzing trace with hash 566408353, now seen corresponding path program 1 times [2024-11-09 01:57:45,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:57:45,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165200692] [2024-11-09 01:57:45,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:57:45,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:57:45,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:57:46,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:57:46,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:57:46,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:57:46,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:57:46,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:57:46,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:57:46,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:57:46,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:57:46,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:57:46,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:57:46,082 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 01:57:46,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:57:46,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165200692] [2024-11-09 01:57:46,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165200692] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:57:46,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:57:46,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:57:46,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163168199] [2024-11-09 01:57:46,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:57:46,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:57:46,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:57:46,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:57:46,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:57:46,085 INFO L87 Difference]: Start difference. First operand 141 states and 196 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 01:57:46,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:57:46,119 INFO L93 Difference]: Finished difference Result 285 states and 397 transitions. [2024-11-09 01:57:46,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:57:46,124 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 63 [2024-11-09 01:57:46,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:57:46,125 INFO L225 Difference]: With dead ends: 285 [2024-11-09 01:57:46,125 INFO L226 Difference]: Without dead ends: 147 [2024-11-09 01:57:46,126 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 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-09 01:57:46,127 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 1 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:57:46,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 281 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:57:46,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-09 01:57:46,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2024-11-09 01:57:46,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 132 states have (on average 1.3636363636363635) internal successors, (180), 132 states have internal predecessors, (180), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 01:57:46,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 200 transitions. [2024-11-09 01:57:46,140 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 200 transitions. Word has length 63 [2024-11-09 01:57:46,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:57:46,140 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 200 transitions. [2024-11-09 01:57:46,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 01:57:46,140 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 200 transitions. [2024-11-09 01:57:46,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-09 01:57:46,142 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:57:46,142 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:57:46,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 01:57:46,143 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:57:46,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:57:46,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1246466723, now seen corresponding path program 1 times [2024-11-09 01:57:46,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:57:46,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630651815] [2024-11-09 01:57:46,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:57:46,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:57:46,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:57:46,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:57:46,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:57:46,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:57:46,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:57:46,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:57:46,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:57:46,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:57:46,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:57:46,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:57:46,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:57:46,296 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 01:57:46,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:57:46,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630651815] [2024-11-09 01:57:46,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630651815] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:57:46,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:57:46,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:57:46,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181809029] [2024-11-09 01:57:46,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:57:46,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:57:46,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:57:46,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:57:46,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:57:46,302 INFO L87 Difference]: Start difference. First operand 145 states and 200 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 01:57:46,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:57:46,325 INFO L93 Difference]: Finished difference Result 293 states and 405 transitions. [2024-11-09 01:57:46,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:57:46,326 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 63 [2024-11-09 01:57:46,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:57:46,327 INFO L225 Difference]: With dead ends: 293 [2024-11-09 01:57:46,327 INFO L226 Difference]: Without dead ends: 151 [2024-11-09 01:57:46,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 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-09 01:57:46,329 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 1 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:57:46,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 282 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:57:46,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-09 01:57:46,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 149. [2024-11-09 01:57:46,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 136 states have (on average 1.3529411764705883) internal successors, (184), 136 states have internal predecessors, (184), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 01:57:46,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 204 transitions. [2024-11-09 01:57:46,350 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 204 transitions. Word has length 63 [2024-11-09 01:57:46,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:57:46,350 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 204 transitions. [2024-11-09 01:57:46,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 01:57:46,351 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 204 transitions. [2024-11-09 01:57:46,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-09 01:57:46,355 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:57:46,355 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:57:46,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 01:57:46,356 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:57:46,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:57:46,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1248313765, now seen corresponding path program 1 times [2024-11-09 01:57:46,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:57:46,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102662236] [2024-11-09 01:57:46,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:57:46,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:57:46,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:57:47,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:57:47,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:57:47,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:57:47,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:57:47,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:57:47,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:57:47,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:57:47,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:57:47,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:57:47,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:57:47,180 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 01:57:47,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:57:47,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102662236] [2024-11-09 01:57:47,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102662236] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:57:47,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:57:47,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 01:57:47,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820590286] [2024-11-09 01:57:47,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:57:47,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 01:57:47,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:57:47,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 01:57:47,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:57:47,184 INFO L87 Difference]: Start difference. First operand 149 states and 204 transitions. Second operand has 9 states, 8 states have (on average 5.125) internal successors, (41), 9 states have internal predecessors, (41), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 01:57:47,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:57:47,459 INFO L93 Difference]: Finished difference Result 301 states and 413 transitions. [2024-11-09 01:57:47,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 01:57:47,460 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 9 states have internal predecessors, (41), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 63 [2024-11-09 01:57:47,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:57:47,461 INFO L225 Difference]: With dead ends: 301 [2024-11-09 01:57:47,462 INFO L226 Difference]: Without dead ends: 155 [2024-11-09 01:57:47,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-11-09 01:57:47,463 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 232 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:57:47,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 392 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:57:47,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-09 01:57:47,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 153. [2024-11-09 01:57:47,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 140 states have (on average 1.3428571428571427) internal successors, (188), 140 states have internal predecessors, (188), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 01:57:47,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 208 transitions. [2024-11-09 01:57:47,476 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 208 transitions. Word has length 63 [2024-11-09 01:57:47,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:57:47,476 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 208 transitions. [2024-11-09 01:57:47,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 9 states have internal predecessors, (41), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 01:57:47,477 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 208 transitions. [2024-11-09 01:57:47,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-09 01:57:47,482 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:57:47,482 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:57:47,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 01:57:47,483 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:57:47,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:57:47,483 INFO L85 PathProgramCache]: Analyzing trace with hash -2085121383, now seen corresponding path program 1 times [2024-11-09 01:57:47,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:57:47,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76499912] [2024-11-09 01:57:47,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:57:47,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:57:47,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:57:47,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:57:47,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:57:47,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:57:47,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:57:47,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:57:47,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:57:47,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:57:47,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:57:47,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:57:47,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:57:47,621 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 01:57:47,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:57:47,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76499912] [2024-11-09 01:57:47,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76499912] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:57:47,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:57:47,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:57:47,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550008037] [2024-11-09 01:57:47,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:57:47,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:57:47,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:57:47,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:57:47,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:57:47,624 INFO L87 Difference]: Start difference. First operand 153 states and 208 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 01:57:47,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:57:47,716 INFO L93 Difference]: Finished difference Result 377 states and 514 transitions. [2024-11-09 01:57:47,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:57:47,717 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 67 [2024-11-09 01:57:47,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:57:47,719 INFO L225 Difference]: With dead ends: 377 [2024-11-09 01:57:47,719 INFO L226 Difference]: Without dead ends: 227 [2024-11-09 01:57:47,720 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:57:47,720 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 85 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:57:47,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 323 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:57:47,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-11-09 01:57:47,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 174. [2024-11-09 01:57:47,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 161 states have (on average 1.3540372670807452) internal successors, (218), 161 states have internal predecessors, (218), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 01:57:47,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 238 transitions. [2024-11-09 01:57:47,737 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 238 transitions. Word has length 67 [2024-11-09 01:57:47,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:57:47,738 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 238 transitions. [2024-11-09 01:57:47,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 01:57:47,739 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 238 transitions. [2024-11-09 01:57:47,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-09 01:57:47,739 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:57:47,740 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:57:47,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 01:57:47,740 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:57:47,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:57:47,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1013672813, now seen corresponding path program 1 times [2024-11-09 01:57:47,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:57:47,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708106034] [2024-11-09 01:57:47,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:57:47,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:57:47,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:57:47,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:57:47,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:57:47,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:57:47,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:57:47,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:57:47,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:57:47,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:57:47,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:57:47,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:57:47,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:57:47,932 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 01:57:47,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:57:47,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708106034] [2024-11-09 01:57:47,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708106034] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:57:47,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:57:47,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:57:47,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844462555] [2024-11-09 01:57:47,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:57:47,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:57:47,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:57:47,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:57:47,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:57:47,935 INFO L87 Difference]: Start difference. First operand 174 states and 238 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 01:57:48,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:57:48,071 INFO L93 Difference]: Finished difference Result 413 states and 566 transitions. [2024-11-09 01:57:48,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:57:48,072 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 67 [2024-11-09 01:57:48,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:57:48,073 INFO L225 Difference]: With dead ends: 413 [2024-11-09 01:57:48,073 INFO L226 Difference]: Without dead ends: 242 [2024-11-09 01:57:48,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:57:48,074 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 267 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:57:48,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 415 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:57:48,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-11-09 01:57:48,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 164. [2024-11-09 01:57:48,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 151 states have (on average 1.3443708609271523) internal successors, (203), 151 states have internal predecessors, (203), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 01:57:48,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 223 transitions. [2024-11-09 01:57:48,084 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 223 transitions. Word has length 67 [2024-11-09 01:57:48,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:57:48,085 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 223 transitions. [2024-11-09 01:57:48,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 01:57:48,085 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 223 transitions. [2024-11-09 01:57:48,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-09 01:57:48,086 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:57:48,086 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:57:48,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 01:57:48,087 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:57:48,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:57:48,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1047048597, now seen corresponding path program 1 times [2024-11-09 01:57:48,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:57:48,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982721134] [2024-11-09 01:57:48,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:57:48,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:57:48,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 01:57:48,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1883610239] [2024-11-09 01:57:48,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:57:48,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:57:48,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:57:48,165 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-09 01:57:48,167 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-09 01:57:48,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:57:48,554 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 01:57:48,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:57:48,749 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 01:57:48,750 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 01:57:48,751 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 01:57:48,775 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-09 01:57:48,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:57:48,959 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:57:49,103 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 01:57:49,105 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 01:57:49 BoogieIcfgContainer [2024-11-09 01:57:49,106 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 01:57:49,107 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 01:57:49,107 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 01:57:49,108 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 01:57:49,108 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:57:44" (3/4) ... [2024-11-09 01:57:49,110 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 01:57:49,111 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 01:57:49,112 INFO L158 Benchmark]: Toolchain (without parser) took 6223.46ms. Allocated memory was 172.0MB in the beginning and 243.3MB in the end (delta: 71.3MB). Free memory was 102.4MB in the beginning and 130.9MB in the end (delta: -28.6MB). Peak memory consumption was 44.8MB. Max. memory is 16.1GB. [2024-11-09 01:57:49,112 INFO L158 Benchmark]: CDTParser took 0.67ms. Allocated memory is still 172.0MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:57:49,113 INFO L158 Benchmark]: CACSL2BoogieTranslator took 302.98ms. Allocated memory is still 172.0MB. Free memory was 102.0MB in the beginning and 86.9MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 01:57:49,113 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.01ms. Allocated memory is still 172.0MB. Free memory was 86.9MB in the beginning and 83.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 01:57:49,113 INFO L158 Benchmark]: Boogie Preprocessor took 171.76ms. Allocated memory is still 172.0MB. Free memory was 83.9MB in the beginning and 138.7MB in the end (delta: -54.9MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. [2024-11-09 01:57:49,114 INFO L158 Benchmark]: RCFGBuilder took 785.51ms. Allocated memory is still 172.0MB. Free memory was 138.7MB in the beginning and 105.2MB in the end (delta: 33.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-09 01:57:49,114 INFO L158 Benchmark]: TraceAbstraction took 4887.22ms. Allocated memory was 172.0MB in the beginning and 243.3MB in the end (delta: 71.3MB). Free memory was 104.5MB in the beginning and 130.9MB in the end (delta: -26.4MB). Peak memory consumption was 46.2MB. Max. memory is 16.1GB. [2024-11-09 01:57:49,114 INFO L158 Benchmark]: Witness Printer took 4.80ms. Allocated memory is still 243.3MB. Free memory is still 130.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:57:49,116 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.67ms. Allocated memory is still 172.0MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 302.98ms. Allocated memory is still 172.0MB. Free memory was 102.0MB in the beginning and 86.9MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.01ms. Allocated memory is still 172.0MB. Free memory was 86.9MB in the beginning and 83.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 171.76ms. Allocated memory is still 172.0MB. Free memory was 83.9MB in the beginning and 138.7MB in the end (delta: -54.9MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. * RCFGBuilder took 785.51ms. Allocated memory is still 172.0MB. Free memory was 138.7MB in the beginning and 105.2MB in the end (delta: 33.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 4887.22ms. Allocated memory was 172.0MB in the beginning and 243.3MB in the end (delta: 71.3MB). Free memory was 104.5MB in the beginning and 130.9MB in the end (delta: -26.4MB). Peak memory consumption was 46.2MB. Max. memory is 16.1GB. * Witness Printer took 4.80ms. Allocated memory is still 243.3MB. Free memory is still 130.9MB. 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 someBinaryDOUBLEComparisonOperation at line 90, overapproximation of shiftLeft at line 90. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 10; [L22] unsigned char var_1_1 = 10; [L23] unsigned char* var_1_1_Pointer = &(var_1_1); [L24] unsigned char var_1_3 = 4; [L24] unsigned char var_1_3 = 4; [L25] unsigned char* var_1_3_Pointer = &(var_1_3); [L26] unsigned char var_1_7 = 0; [L26] unsigned char var_1_7 = 0; [L27] unsigned char* var_1_7_Pointer = &(var_1_7); [L28] signed short int var_1_8 = 100; [L28] signed short int var_1_8 = 100; [L29] signed short int* var_1_8_Pointer = &(var_1_8); [L30] unsigned char var_1_9 = 32; [L30] unsigned char var_1_9 = 32; [L31] unsigned char* var_1_9_Pointer = &(var_1_9); [L32] double var_1_10 = 9.2; [L32] double var_1_10 = 9.2; [L33] double* var_1_10_Pointer = &(var_1_10); [L34] double var_1_11 = 0.975; [L34] double var_1_11 = 0.975; [L35] double* var_1_11_Pointer = &(var_1_11); [L36] signed short int var_1_12 = 1; [L36] signed short int var_1_12 = 1; [L37] signed short int* var_1_12_Pointer = &(var_1_12); [L38] signed long int var_1_14 = -16; [L38] signed long int var_1_14 = -16; [L39] signed long int* var_1_14_Pointer = &(var_1_14); [L40] unsigned char last_1_var_1_1 = 10; [L41] double last_1_var_1_10 = 9.2; [L42] signed short int last_1_var_1_12 = 1; [L43] signed long int last_1_var_1_14 = -16; VAL [isInitial=0, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L94] isInitial = 1 [L95] FCALL initially() [L96] COND TRUE 1 [L97] CALL updateLastVariables() [L84] EXPR \read(var_1_1) [L84] last_1_var_1_1 = var_1_1 [L85] EXPR \read(var_1_10) [L85] last_1_var_1_10 = var_1_10 [L86] EXPR \read(var_1_12) [L86] last_1_var_1_12 = var_1_12 [L87] EXPR \read(var_1_14) [L87] last_1_var_1_14 = var_1_14 [L97] RET updateLastVariables() [L98] CALL updateVariables() [L74] var_1_3 = __VERIFIER_nondet_uchar() [L75] EXPR \read(var_1_3) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L75] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L75] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L76] EXPR \read(var_1_3) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L76] CALL assume_abort_if_not(var_1_3 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L76] RET assume_abort_if_not(var_1_3 <= 254) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L77] var_1_7 = __VERIFIER_nondet_uchar() [L78] EXPR \read(var_1_7) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L78] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L78] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L79] EXPR \read(var_1_7) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L79] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L79] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L80] var_1_11 = __VERIFIER_nondet_double() [L81] EXPR \read(var_1_11) [L81] EXPR var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L81] EXPR var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F [L81] EXPR \read(var_1_11) [L81] EXPR var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L81] EXPR (var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L81] EXPR (var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L81] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L81] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L98] RET updateVariables() [L99] CALL step() [L47] unsigned char stepLocal_0 = last_1_var_1_10 > last_1_var_1_10; VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, stepLocal_0=0, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L48] COND FALSE !(((last_1_var_1_12 + last_1_var_1_1) < 10) || stepLocal_0) [L51] (*(var_1_12_Pointer)) = last_1_var_1_12 VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L53] EXPR \read(*var_1_12_Pointer) [L53] (*(var_1_14_Pointer)) = (*(var_1_12_Pointer)) [L54] EXPR \read(*var_1_12_Pointer) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L54] EXPR 10 << (*(var_1_12_Pointer)) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L54] EXPR \read(*var_1_3_Pointer) [L54] EXPR \read(*var_1_14_Pointer) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L54] COND TRUE (10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer))) [L55] EXPR \read(*var_1_12_Pointer) [L55] EXPR \read(*var_1_14_Pointer) [L55] (*(var_1_8_Pointer)) = ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))) [L57] (*(var_1_9_Pointer)) = 64 [L58] EXPR \read(*var_1_11_Pointer) [L58] (*(var_1_10_Pointer)) = (*(var_1_11_Pointer)) [L59] EXPR \read(*var_1_12_Pointer) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L59] COND TRUE (*(var_1_12_Pointer)) <= 16 [L60] EXPR \read(*var_1_3_Pointer) [L60] (*(var_1_1_Pointer)) = (*(var_1_3_Pointer)) [L99] RET step() [L100] CALL, EXPR property() [L90] EXPR \read(*var_1_12_Pointer) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L90] EXPR ((*(var_1_12_Pointer)) <= 16) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : (((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) [L90] EXPR \read(*var_1_1_Pointer) [L90] EXPR \read(*var_1_3_Pointer) [L90] EXPR ((*(var_1_12_Pointer)) <= 16) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : (((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L90] EXPR (((*(var_1_12_Pointer)) <= 16) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : (((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))))) && (((10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer)))) ? ((*(var_1_8_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))))) : 1) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L90] EXPR (((*(var_1_12_Pointer)) <= 16) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : (((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))))) && (((10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer)))) ? ((*(var_1_8_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))))) : 1) [L90] EXPR \read(*var_1_12_Pointer) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L90] EXPR 10 << (*(var_1_12_Pointer)) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L90] EXPR \read(*var_1_3_Pointer) [L90] EXPR \read(*var_1_14_Pointer) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L90] EXPR ((10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer)))) ? ((*(var_1_8_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))))) : 1 [L90] EXPR \read(*var_1_8_Pointer) [L90] EXPR \read(*var_1_12_Pointer) [L90] EXPR \read(*var_1_14_Pointer) [L90] EXPR ((10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer)))) ? ((*(var_1_8_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))))) : 1 VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L90] EXPR (((*(var_1_12_Pointer)) <= 16) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : (((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))))) && (((10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer)))) ? ((*(var_1_8_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))))) : 1) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L90] EXPR ((((*(var_1_12_Pointer)) <= 16) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : (((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))))) && (((10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer)))) ? ((*(var_1_8_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))))) : 1)) && ((*(var_1_9_Pointer)) == ((unsigned char) 64)) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L90] EXPR ((((*(var_1_12_Pointer)) <= 16) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : (((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))))) && (((10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer)))) ? ((*(var_1_8_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))))) : 1)) && ((*(var_1_9_Pointer)) == ((unsigned char) 64)) [L90] EXPR \read(*var_1_9_Pointer) [L90] EXPR ((((*(var_1_12_Pointer)) <= 16) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : (((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))))) && (((10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer)))) ? ((*(var_1_8_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))))) : 1)) && ((*(var_1_9_Pointer)) == ((unsigned char) 64)) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L90] EXPR (((((*(var_1_12_Pointer)) <= 16) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : (((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))))) && (((10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer)))) ? ((*(var_1_8_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))))) : 1)) && ((*(var_1_9_Pointer)) == ((unsigned char) 64))) && ((*(var_1_10_Pointer)) == ((double) (*(var_1_11_Pointer)))) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L90] EXPR (((((*(var_1_12_Pointer)) <= 16) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : (((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))))) && (((10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer)))) ? ((*(var_1_8_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))))) : 1)) && ((*(var_1_9_Pointer)) == ((unsigned char) 64))) && ((*(var_1_10_Pointer)) == ((double) (*(var_1_11_Pointer)))) [L90] EXPR \read(*var_1_10_Pointer) [L90] EXPR \read(*var_1_11_Pointer) [L90] EXPR (((((*(var_1_12_Pointer)) <= 16) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : (((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))))) && (((10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer)))) ? ((*(var_1_8_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))))) : 1)) && ((*(var_1_9_Pointer)) == ((unsigned char) 64))) && ((*(var_1_10_Pointer)) == ((double) (*(var_1_11_Pointer)))) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L90] EXPR ((((((*(var_1_12_Pointer)) <= 16) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : (((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))))) && (((10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer)))) ? ((*(var_1_8_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))))) : 1)) && ((*(var_1_9_Pointer)) == ((unsigned char) 64))) && ((*(var_1_10_Pointer)) == ((double) (*(var_1_11_Pointer))))) && ((((last_1_var_1_12 + last_1_var_1_1) < 10) || (last_1_var_1_10 > last_1_var_1_10)) ? ((*(var_1_12_Pointer)) == ((signed short int) (((((((*(var_1_3_Pointer)) + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) > (last_1_var_1_1)) ? ((((*(var_1_3_Pointer)) + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) : (last_1_var_1_1))))) : ((*(var_1_12_Pointer)) == ((signed short int) last_1_var_1_12))) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L90] EXPR ((((((*(var_1_12_Pointer)) <= 16) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : (((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))))) && (((10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer)))) ? ((*(var_1_8_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))))) : 1)) && ((*(var_1_9_Pointer)) == ((unsigned char) 64))) && ((*(var_1_10_Pointer)) == ((double) (*(var_1_11_Pointer))))) && ((((last_1_var_1_12 + last_1_var_1_1) < 10) || (last_1_var_1_10 > last_1_var_1_10)) ? ((*(var_1_12_Pointer)) == ((signed short int) (((((((*(var_1_3_Pointer)) + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) > (last_1_var_1_1)) ? ((((*(var_1_3_Pointer)) + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) : (last_1_var_1_1))))) : ((*(var_1_12_Pointer)) == ((signed short int) last_1_var_1_12))) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L90] EXPR (((((((*(var_1_12_Pointer)) <= 16) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : (((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))))) && (((10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer)))) ? ((*(var_1_8_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))))) : 1)) && ((*(var_1_9_Pointer)) == ((unsigned char) 64))) && ((*(var_1_10_Pointer)) == ((double) (*(var_1_11_Pointer))))) && ((((last_1_var_1_12 + last_1_var_1_1) < 10) || (last_1_var_1_10 > last_1_var_1_10)) ? ((*(var_1_12_Pointer)) == ((signed short int) (((((((*(var_1_3_Pointer)) + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) > (last_1_var_1_1)) ? ((((*(var_1_3_Pointer)) + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) : (last_1_var_1_1))))) : ((*(var_1_12_Pointer)) == ((signed short int) last_1_var_1_12)))) && ((*(var_1_14_Pointer)) == ((signed long int) (*(var_1_12_Pointer)))) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L90] EXPR (((((((*(var_1_12_Pointer)) <= 16) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : (((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))))) && (((10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer)))) ? ((*(var_1_8_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))))) : 1)) && ((*(var_1_9_Pointer)) == ((unsigned char) 64))) && ((*(var_1_10_Pointer)) == ((double) (*(var_1_11_Pointer))))) && ((((last_1_var_1_12 + last_1_var_1_1) < 10) || (last_1_var_1_10 > last_1_var_1_10)) ? ((*(var_1_12_Pointer)) == ((signed short int) (((((((*(var_1_3_Pointer)) + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) > (last_1_var_1_1)) ? ((((*(var_1_3_Pointer)) + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) : (last_1_var_1_1))))) : ((*(var_1_12_Pointer)) == ((signed short int) last_1_var_1_12)))) && ((*(var_1_14_Pointer)) == ((signed long int) (*(var_1_12_Pointer)))) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L90-L91] return (((((((*(var_1_12_Pointer)) <= 16) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : (((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))))) && (((10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer)))) ? ((*(var_1_8_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))))) : 1)) && ((*(var_1_9_Pointer)) == ((unsigned char) 64))) && ((*(var_1_10_Pointer)) == ((double) (*(var_1_11_Pointer))))) && ((((last_1_var_1_12 + last_1_var_1_1) < 10) || (last_1_var_1_10 > last_1_var_1_10)) ? ((*(var_1_12_Pointer)) == ((signed short int) (((((((*(var_1_3_Pointer)) + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) > (last_1_var_1_1)) ? ((((*(var_1_3_Pointer)) + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) : (last_1_var_1_1))))) : ((*(var_1_12_Pointer)) == ((signed short int) last_1_var_1_12)))) && ((*(var_1_14_Pointer)) == ((signed long int) (*(var_1_12_Pointer)))) ; [L100] RET, EXPR property() [L100] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 76 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.7s, OverallIterations: 9, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 906 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 906 mSDsluCounter, 2576 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1856 mSDsCounter, 79 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 448 IncrementalHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 79 mSolverCounterUnsat, 720 mSDtfsCounter, 448 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 137 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=174occurred in iteration=7, InterpolantAutomatonStates: 37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 189 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 645 NumberOfCodeBlocks, 645 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 501 ConstructedInterpolants, 0 QuantifiedInterpolants, 908 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 320/320 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-09 01:57:49,150 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-p_file-9.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 aa8cc58df8fe09b61997a2de9d9c5e7a83d2492c15b287abd5439e2c29784fc7 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:57:51,380 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:57:51,454 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 01:57:51,461 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:57:51,462 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:57:51,492 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:57:51,493 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:57:51,493 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:57:51,494 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:57:51,494 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:57:51,495 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:57:51,495 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:57:51,496 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:57:51,496 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:57:51,496 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:57:51,497 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:57:51,497 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:57:51,497 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:57:51,498 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:57:51,498 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:57:51,499 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:57:51,499 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:57:51,499 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:57:51,500 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 01:57:51,500 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 01:57:51,500 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:57:51,501 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 01:57:51,501 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:57:51,501 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:57:51,502 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:57:51,502 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:57:51,502 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:57:51,502 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:57:51,503 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:57:51,503 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:57:51,503 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:57:51,504 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:57:51,504 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:57:51,504 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 01:57:51,504 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 01:57:51,505 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:57:51,508 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:57:51,508 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:57:51,508 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:57:51,508 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 -> aa8cc58df8fe09b61997a2de9d9c5e7a83d2492c15b287abd5439e2c29784fc7 [2024-11-09 01:57:51,835 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:57:51,860 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:57:51,864 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:57:51,865 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:57:51,866 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:57:51,867 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-9.i [2024-11-09 01:57:53,541 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:57:53,762 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:57:53,762 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-9.i [2024-11-09 01:57:53,776 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a2253c69/cf7b059153d6474e905180c6b0380c70/FLAG67fc24db1 [2024-11-09 01:57:53,791 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a2253c69/cf7b059153d6474e905180c6b0380c70 [2024-11-09 01:57:53,795 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:57:53,796 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:57:53,797 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:57:53,798 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:57:53,803 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:57:53,804 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:57:53" (1/1) ... [2024-11-09 01:57:53,805 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ecf4a71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:57:53, skipping insertion in model container [2024-11-09 01:57:53,806 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:57:53" (1/1) ... [2024-11-09 01:57:53,836 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:57:54,026 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-p_file-9.i[915,928] [2024-11-09 01:57:54,094 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:57:54,117 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:57:54,148 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-p_file-9.i[915,928] [2024-11-09 01:57:54,182 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:57:54,215 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:57:54,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:57:54 WrapperNode [2024-11-09 01:57:54,216 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:57:54,217 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:57:54,217 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:57:54,217 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:57:54,224 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:57:54" (1/1) ... [2024-11-09 01:57:54,244 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:57:54" (1/1) ... [2024-11-09 01:57:54,287 INFO L138 Inliner]: procedures = 36, calls = 111, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 353 [2024-11-09 01:57:54,291 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:57:54,292 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:57:54,292 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:57:54,292 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:57:54,304 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:57:54" (1/1) ... [2024-11-09 01:57:54,304 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:57:54" (1/1) ... [2024-11-09 01:57:54,315 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:57:54" (1/1) ... [2024-11-09 01:57:54,344 INFO L175 MemorySlicer]: Split 86 memory accesses to 10 slices as follows [2, 10, 18, 6, 3, 3, 14, 8, 14, 8]. 21 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 13 writes are split as follows [0, 4, 1, 1, 1, 1, 1, 1, 2, 1]. [2024-11-09 01:57:54,345 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:57:54" (1/1) ... [2024-11-09 01:57:54,345 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:57:54" (1/1) ... [2024-11-09 01:57:54,374 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:57:54" (1/1) ... [2024-11-09 01:57:54,378 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:57:54" (1/1) ... [2024-11-09 01:57:54,383 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:57:54" (1/1) ... [2024-11-09 01:57:54,386 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:57:54" (1/1) ... [2024-11-09 01:57:54,394 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:57:54,395 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:57:54,395 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:57:54,395 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:57:54,396 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:57:54" (1/1) ... [2024-11-09 01:57:54,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:57:54,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:57:54,436 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-09 01:57:54,439 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-09 01:57:54,492 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:57:54,493 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-09 01:57:54,493 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-09 01:57:54,493 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-09 01:57:54,493 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-09 01:57:54,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-09 01:57:54,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-11-09 01:57:54,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2024-11-09 01:57:54,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#7 [2024-11-09 01:57:54,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#8 [2024-11-09 01:57:54,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#9 [2024-11-09 01:57:54,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-09 01:57:54,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-09 01:57:54,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-09 01:57:54,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-09 01:57:54,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-09 01:57:54,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-11-09 01:57:54,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2024-11-09 01:57:54,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#7 [2024-11-09 01:57:54,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#8 [2024-11-09 01:57:54,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#9 [2024-11-09 01:57:54,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-09 01:57:54,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-09 01:57:54,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-09 01:57:54,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-09 01:57:54,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-09 01:57:54,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-09 01:57:54,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-11-09 01:57:54,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-11-09 01:57:54,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2024-11-09 01:57:54,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2024-11-09 01:57:54,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-09 01:57:54,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-09 01:57:54,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-09 01:57:54,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-09 01:57:54,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-09 01:57:54,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-09 01:57:54,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-11-09 01:57:54,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2024-11-09 01:57:54,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2024-11-09 01:57:54,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2024-11-09 01:57:54,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 01:57:54,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 01:57:54,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-09 01:57:54,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-09 01:57:54,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-09 01:57:54,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-09 01:57:54,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-09 01:57:54,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-11-09 01:57:54,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2024-11-09 01:57:54,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2024-11-09 01:57:54,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-09 01:57:54,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-09 01:57:54,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-09 01:57:54,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-09 01:57:54,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-09 01:57:54,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-09 01:57:54,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-11-09 01:57:54,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2024-11-09 01:57:54,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2024-11-09 01:57:54,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2024-11-09 01:57:54,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-09 01:57:54,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-09 01:57:54,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-09 01:57:54,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-09 01:57:54,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-09 01:57:54,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-11-09 01:57:54,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2024-11-09 01:57:54,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#7 [2024-11-09 01:57:54,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#8 [2024-11-09 01:57:54,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#9 [2024-11-09 01:57:54,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-09 01:57:54,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-09 01:57:54,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-09 01:57:54,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-09 01:57:54,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-09 01:57:54,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-09 01:57:54,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-11-09 01:57:54,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2024-11-09 01:57:54,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2024-11-09 01:57:54,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2024-11-09 01:57:54,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-09 01:57:54,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-09 01:57:54,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-09 01:57:54,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-09 01:57:54,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-09 01:57:54,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-11-09 01:57:54,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-11-09 01:57:54,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2024-11-09 01:57:54,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2024-11-09 01:57:54,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2024-11-09 01:57:54,505 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:57:54,505 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:57:54,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:57:54,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:57:54,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-09 01:57:54,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-09 01:57:54,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-09 01:57:54,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-09 01:57:54,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-09 01:57:54,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-09 01:57:54,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-11-09 01:57:54,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-11-09 01:57:54,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2024-11-09 01:57:54,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2024-11-09 01:57:54,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-09 01:57:54,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-09 01:57:54,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-09 01:57:54,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-09 01:57:54,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-09 01:57:54,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-11-09 01:57:54,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-11-09 01:57:54,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2024-11-09 01:57:54,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2024-11-09 01:57:54,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2024-11-09 01:57:54,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-09 01:57:54,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-09 01:57:54,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-09 01:57:54,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-09 01:57:54,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-09 01:57:54,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-09 01:57:54,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-11-09 01:57:54,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2024-11-09 01:57:54,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2024-11-09 01:57:54,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2024-11-09 01:57:54,795 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:57:54,798 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:57:55,429 INFO L? ?]: Removed 79 outVars from TransFormulas that were not future-live. [2024-11-09 01:57:55,429 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:57:55,442 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:57:55,442 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:57:55,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:57:55 BoogieIcfgContainer [2024-11-09 01:57:55,443 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:57:55,447 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:57:55,447 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:57:55,451 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:57:55,451 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:57:53" (1/3) ... [2024-11-09 01:57:55,452 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36ff8220 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:57:55, skipping insertion in model container [2024-11-09 01:57:55,452 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:57:54" (2/3) ... [2024-11-09 01:57:55,452 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36ff8220 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:57:55, skipping insertion in model container [2024-11-09 01:57:55,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:57:55" (3/3) ... [2024-11-09 01:57:55,454 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-9.i [2024-11-09 01:57:55,473 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:57:55,473 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:57:55,548 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:57:55,556 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;@4b909be1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:57:55,557 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:57:55,561 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 62 states have (on average 1.435483870967742) internal successors, (89), 63 states have internal predecessors, (89), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 01:57:55,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-09 01:57:55,571 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:57:55,572 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:57:55,573 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:57:55,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:57:55,580 INFO L85 PathProgramCache]: Analyzing trace with hash -562539789, now seen corresponding path program 1 times [2024-11-09 01:57:55,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:57:55,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1501383120] [2024-11-09 01:57:55,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:57:55,598 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-09 01:57:55,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:57:55,599 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-09 01:57:55,600 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-09 01:57:55,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:57:55,981 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 01:57:55,990 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:57:56,025 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-09 01:57:56,025 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:57:56,026 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:57:56,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1501383120] [2024-11-09 01:57:56,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1501383120] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:57:56,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:57:56,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:57:56,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518193888] [2024-11-09 01:57:56,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:57:56,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:57:56,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:57:56,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:57:56,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:57:56,066 INFO L87 Difference]: Start difference. First operand has 70 states, 62 states have (on average 1.435483870967742) internal successors, (89), 63 states have internal predecessors, (89), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 01:57:56,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:57:56,096 INFO L93 Difference]: Finished difference Result 133 states and 197 transitions. [2024-11-09 01:57:56,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:57:56,099 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 60 [2024-11-09 01:57:56,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:57:56,106 INFO L225 Difference]: With dead ends: 133 [2024-11-09 01:57:56,106 INFO L226 Difference]: Without dead ends: 66 [2024-11-09 01:57:56,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 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-09 01:57:56,115 INFO L432 NwaCegarLoop]: 92 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, 92 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-09 01:57:56,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:57:56,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-09 01:57:56,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-09 01:57:56,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 59 states have (on average 1.3898305084745763) internal successors, (82), 59 states have internal predecessors, (82), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 01:57:56,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 92 transitions. [2024-11-09 01:57:56,162 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 92 transitions. Word has length 60 [2024-11-09 01:57:56,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:57:56,162 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 92 transitions. [2024-11-09 01:57:56,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 01:57:56,163 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 92 transitions. [2024-11-09 01:57:56,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-09 01:57:56,166 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:57:56,166 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:57:56,176 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-09 01:57:56,370 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-09 01:57:56,371 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:57:56,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:57:56,372 INFO L85 PathProgramCache]: Analyzing trace with hash -830046663, now seen corresponding path program 1 times [2024-11-09 01:57:56,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:57:56,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1695106912] [2024-11-09 01:57:56,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:57:56,373 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-09 01:57:56,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:57:56,377 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-09 01:57:56,380 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-09 01:57:56,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:57:56,711 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 01:57:56,717 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:57:56,760 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 01:57:56,760 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:57:56,760 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:57:56,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1695106912] [2024-11-09 01:57:56,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1695106912] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:57:56,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:57:56,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:57:56,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031639693] [2024-11-09 01:57:56,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:57:56,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:57:56,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:57:56,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:57:56,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:57:56,768 INFO L87 Difference]: Start difference. First operand 66 states and 92 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 01:57:56,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:57:56,816 INFO L93 Difference]: Finished difference Result 132 states and 185 transitions. [2024-11-09 01:57:56,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:57:56,817 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 60 [2024-11-09 01:57:56,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:57:56,819 INFO L225 Difference]: With dead ends: 132 [2024-11-09 01:57:56,820 INFO L226 Difference]: Without dead ends: 69 [2024-11-09 01:57:56,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 57 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-09 01:57:56,822 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 1 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:57:56,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 256 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:57:56,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-09 01:57:56,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2024-11-09 01:57:56,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 61 states have (on average 1.3770491803278688) internal successors, (84), 61 states have internal predecessors, (84), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 01:57:56,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 94 transitions. [2024-11-09 01:57:56,837 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 94 transitions. Word has length 60 [2024-11-09 01:57:56,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:57:56,841 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 94 transitions. [2024-11-09 01:57:56,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 01:57:56,842 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 94 transitions. [2024-11-09 01:57:56,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-09 01:57:56,843 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:57:56,843 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:57:56,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-09 01:57:57,044 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-09 01:57:57,044 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:57:57,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:57:57,045 INFO L85 PathProgramCache]: Analyzing trace with hash -128982085, now seen corresponding path program 1 times [2024-11-09 01:57:57,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:57:57,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2078779681] [2024-11-09 01:57:57,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:57:57,046 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-09 01:57:57,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:57:57,049 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-09 01:57:57,050 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-09 01:57:57,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:57:57,353 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 01:57:57,358 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:57:57,386 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 01:57:57,386 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:57:57,386 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:57:57,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2078779681] [2024-11-09 01:57:57,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2078779681] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:57:57,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:57:57,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:57:57,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163400115] [2024-11-09 01:57:57,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:57:57,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:57:57,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:57:57,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:57:57,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:57:57,391 INFO L87 Difference]: Start difference. First operand 68 states and 94 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 01:57:57,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:57:57,445 INFO L93 Difference]: Finished difference Result 136 states and 189 transitions. [2024-11-09 01:57:57,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:57:57,445 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 60 [2024-11-09 01:57:57,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:57:57,447 INFO L225 Difference]: With dead ends: 136 [2024-11-09 01:57:57,447 INFO L226 Difference]: Without dead ends: 71 [2024-11-09 01:57:57,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 56 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-09 01:57:57,449 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 1 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:57:57,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 333 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:57:57,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-09 01:57:57,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2024-11-09 01:57:57,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 63 states have (on average 1.3650793650793651) internal successors, (86), 63 states have internal predecessors, (86), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 01:57:57,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 96 transitions. [2024-11-09 01:57:57,460 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 96 transitions. Word has length 60 [2024-11-09 01:57:57,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:57:57,460 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 96 transitions. [2024-11-09 01:57:57,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 01:57:57,461 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 96 transitions. [2024-11-09 01:57:57,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-09 01:57:57,463 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:57:57,463 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:57:57,472 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-09 01:57:57,667 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-09 01:57:57,668 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:57:57,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:57:57,669 INFO L85 PathProgramCache]: Analyzing trace with hash 551076285, now seen corresponding path program 1 times [2024-11-09 01:57:57,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:57:57,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2085130832] [2024-11-09 01:57:57,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:57:57,672 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-09 01:57:57,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:57:57,674 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-09 01:57:57,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-09 01:57:57,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:57:57,905 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 01:57:57,908 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:57:57,961 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 01:57:57,962 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:57:57,962 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:57:57,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2085130832] [2024-11-09 01:57:57,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2085130832] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:57:57,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:57:57,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 01:57:57,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791033900] [2024-11-09 01:57:57,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:57:57,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 01:57:57,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:57:57,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 01:57:57,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:57:57,964 INFO L87 Difference]: Start difference. First operand 70 states and 96 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 01:57:58,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:57:58,047 INFO L93 Difference]: Finished difference Result 142 states and 196 transitions. [2024-11-09 01:57:58,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:57:58,048 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 60 [2024-11-09 01:57:58,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:57:58,049 INFO L225 Difference]: With dead ends: 142 [2024-11-09 01:57:58,049 INFO L226 Difference]: Without dead ends: 75 [2024-11-09 01:57:58,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:57:58,051 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 1 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:57:58,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 479 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:57:58,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-09 01:57:58,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2024-11-09 01:57:58,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 67 states have (on average 1.3432835820895523) internal successors, (90), 67 states have internal predecessors, (90), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 01:57:58,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 100 transitions. [2024-11-09 01:57:58,064 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 100 transitions. Word has length 60 [2024-11-09 01:57:58,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:57:58,064 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 100 transitions. [2024-11-09 01:57:58,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 01:57:58,065 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 100 transitions. [2024-11-09 01:57:58,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-09 01:57:58,068 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:57:58,068 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:57:58,078 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 (5)] Forceful destruction successful, exit code 0 [2024-11-09 01:57:58,268 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-09 01:57:58,269 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:57:58,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:57:58,269 INFO L85 PathProgramCache]: Analyzing trace with hash 552923327, now seen corresponding path program 1 times [2024-11-09 01:57:58,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:57:58,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1050595087] [2024-11-09 01:57:58,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:57:58,270 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-09 01:57:58,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:57:58,271 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-09 01:57:58,272 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-09 01:57:58,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:57:58,545 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 01:57:58,549 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:57:58,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-09 01:57:58,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 42 [2024-11-09 01:57:58,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2024-11-09 01:57:58,702 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 01:57:58,703 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:57:58,703 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:57:58,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1050595087] [2024-11-09 01:57:58,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1050595087] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:57:58,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:57:58,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:57:58,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845223246] [2024-11-09 01:57:58,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:57:58,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:57:58,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:57:58,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:57:58,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:57:58,707 INFO L87 Difference]: Start difference. First operand 74 states and 100 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 01:57:58,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:57:58,934 INFO L93 Difference]: Finished difference Result 149 states and 202 transitions. [2024-11-09 01:57:58,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:57:58,935 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 60 [2024-11-09 01:57:58,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:57:58,936 INFO L225 Difference]: With dead ends: 149 [2024-11-09 01:57:58,936 INFO L226 Difference]: Without dead ends: 78 [2024-11-09 01:57:58,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:57:58,937 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 134 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:57:58,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 244 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:57:58,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-09 01:57:58,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2024-11-09 01:57:58,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 69 states have (on average 1.3333333333333333) internal successors, (92), 69 states have internal predecessors, (92), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 01:57:58,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 102 transitions. [2024-11-09 01:57:58,944 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 102 transitions. Word has length 60 [2024-11-09 01:57:58,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:57:58,944 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 102 transitions. [2024-11-09 01:57:58,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 01:57:58,945 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 102 transitions. [2024-11-09 01:57:58,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-09 01:57:58,946 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:57:58,946 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:57:58,954 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-09 01:57:59,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:57:59,147 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:57:59,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:57:59,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1489190506, now seen corresponding path program 1 times [2024-11-09 01:57:59,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:57:59,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [61565251] [2024-11-09 01:57:59,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:57:59,156 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-09 01:57:59,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:57:59,159 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:57:59,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-09 01:57:59,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:57:59,469 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 01:57:59,473 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:58:00,145 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 18 treesize of output 19 [2024-11-09 01:58:00,557 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:58:00,557 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 200 treesize of output 130 [2024-11-09 01:58:00,564 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:58:00,564 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 285 treesize of output 135 [2024-11-09 01:58:00,636 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 01:58:00,637 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:58:00,924 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:58:00,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [61565251] [2024-11-09 01:58:00,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [61565251] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:58:00,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1052804923] [2024-11-09 01:58:00,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:58:00,925 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 01:58:00,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-09 01:58:00,929 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 01:58:00,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-11-09 01:58:01,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:58:01,783 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 01:58:01,789 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:58:02,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-11-09 01:58:03,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-11-09 01:58:04,107 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:58:04,110 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 174 treesize of output 118 [2024-11-09 01:58:04,116 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 0 case distinctions, treesize of input 271 treesize of output 143 [2024-11-09 01:58:04,146 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 01:58:04,147 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:58:04,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1052804923] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:58:04,292 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 01:58:04,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2024-11-09 01:58:04,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603633231] [2024-11-09 01:58:04,293 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 01:58:04,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 01:58:04,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:58:04,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 01:58:04,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2024-11-09 01:58:04,294 INFO L87 Difference]: Start difference. First operand 76 states and 102 transitions. Second operand has 16 states, 16 states have (on average 4.875) internal successors, (78), 15 states have internal predecessors, (78), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-09 01:58:05,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:58:05,944 INFO L93 Difference]: Finished difference Result 223 states and 298 transitions. [2024-11-09 01:58:05,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 01:58:05,946 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.875) internal successors, (78), 15 states have internal predecessors, (78), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 62 [2024-11-09 01:58:05,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:58:05,947 INFO L225 Difference]: With dead ends: 223 [2024-11-09 01:58:05,947 INFO L226 Difference]: Without dead ends: 150 [2024-11-09 01:58:05,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 157 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2024-11-09 01:58:05,949 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 293 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:58:05,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 672 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 01:58:05,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-09 01:58:05,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 147. [2024-11-09 01:58:05,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 133 states have (on average 1.3233082706766917) internal successors, (176), 134 states have internal predecessors, (176), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 01:58:05,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 196 transitions. [2024-11-09 01:58:05,967 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 196 transitions. Word has length 62 [2024-11-09 01:58:05,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:58:05,967 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 196 transitions. [2024-11-09 01:58:05,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.875) internal successors, (78), 15 states have internal predecessors, (78), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-09 01:58:05,968 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 196 transitions. [2024-11-09 01:58:05,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-09 01:58:05,969 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:58:05,969 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:58:05,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-09 01:58:06,184 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2024-11-09 01:58:06,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-09 01:58:06,374 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:58:06,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:58:06,374 INFO L85 PathProgramCache]: Analyzing trace with hash -809132136, now seen corresponding path program 1 times [2024-11-09 01:58:06,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:58:06,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [128378424] [2024-11-09 01:58:06,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:58:06,375 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-09 01:58:06,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:58:06,376 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-09 01:58:06,377 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-09 01:58:06,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:58:06,589 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 01:58:06,591 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:58:06,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-09 01:58:06,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2024-11-09 01:58:06,632 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 01:58:06,633 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:58:06,633 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:58:06,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [128378424] [2024-11-09 01:58:06,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [128378424] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:58:06,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:58:06,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:58:06,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560809371] [2024-11-09 01:58:06,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:58:06,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:58:06,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:58:06,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:58:06,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:58:06,634 INFO L87 Difference]: Start difference. First operand 147 states and 196 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 01:58:06,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:58:06,710 INFO L93 Difference]: Finished difference Result 334 states and 446 transitions. [2024-11-09 01:58:06,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:58:06,711 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 62 [2024-11-09 01:58:06,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:58:06,715 INFO L225 Difference]: With dead ends: 334 [2024-11-09 01:58:06,716 INFO L226 Difference]: Without dead ends: 190 [2024-11-09 01:58:06,717 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:58:06,718 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 81 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:58:06,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 407 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:58:06,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-09 01:58:06,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 147. [2024-11-09 01:58:06,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 133 states have (on average 1.3082706766917294) internal successors, (174), 134 states have internal predecessors, (174), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 01:58:06,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 194 transitions. [2024-11-09 01:58:06,752 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 194 transitions. Word has length 62 [2024-11-09 01:58:06,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:58:06,753 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 194 transitions. [2024-11-09 01:58:06,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 01:58:06,753 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 194 transitions. [2024-11-09 01:58:06,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-09 01:58:06,754 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:58:06,758 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:58:06,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-09 01:58:06,959 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-09 01:58:06,959 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:58:06,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:58:06,960 INFO L85 PathProgramCache]: Analyzing trace with hash -108067558, now seen corresponding path program 1 times [2024-11-09 01:58:06,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:58:06,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [815624457] [2024-11-09 01:58:06,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:58:06,960 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-09 01:58:06,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:58:06,962 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-09 01:58:06,964 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-09 01:58:07,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:58:07,171 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 01:58:07,174 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:58:07,470 INFO L349 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2024-11-09 01:58:07,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2024-11-09 01:58:07,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-09 01:58:07,534 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 25 treesize of output 21 [2024-11-09 01:58:07,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 75 [2024-11-09 01:58:07,665 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-09 01:58:07,666 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 84 treesize of output 64 [2024-11-09 01:58:07,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 51 [2024-11-09 01:58:07,709 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 01:58:07,710 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:58:07,710 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:58:07,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [815624457] [2024-11-09 01:58:07,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [815624457] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:58:07,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:58:07,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 01:58:07,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102575200] [2024-11-09 01:58:07,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:58:07,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 01:58:07,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:58:07,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 01:58:07,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:58:07,712 INFO L87 Difference]: Start difference. First operand 147 states and 194 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 01:58:08,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:58:08,806 INFO L93 Difference]: Finished difference Result 630 states and 834 transitions. [2024-11-09 01:58:08,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 01:58:08,807 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 62 [2024-11-09 01:58:08,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:58:08,810 INFO L225 Difference]: With dead ends: 630 [2024-11-09 01:58:08,810 INFO L226 Difference]: Without dead ends: 486 [2024-11-09 01:58:08,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2024-11-09 01:58:08,813 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 393 mSDsluCounter, 776 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 01:58:08,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 916 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 01:58:08,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2024-11-09 01:58:08,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 435. [2024-11-09 01:58:08,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 395 states have (on average 1.2962025316455696) internal successors, (512), 398 states have internal predecessors, (512), 30 states have call successors, (30), 9 states have call predecessors, (30), 9 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-09 01:58:08,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 572 transitions. [2024-11-09 01:58:08,868 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 572 transitions. Word has length 62 [2024-11-09 01:58:08,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:58:08,869 INFO L471 AbstractCegarLoop]: Abstraction has 435 states and 572 transitions. [2024-11-09 01:58:08,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 01:58:08,869 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 572 transitions. [2024-11-09 01:58:08,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-09 01:58:08,874 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:58:08,874 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:58:08,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-09 01:58:09,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:58:09,075 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:58:09,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:58:09,076 INFO L85 PathProgramCache]: Analyzing trace with hash 314634268, now seen corresponding path program 1 times [2024-11-09 01:58:09,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:58:09,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [991610296] [2024-11-09 01:58:09,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:58:09,076 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-09 01:58:09,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:58:09,077 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:58:09,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-09 01:58:09,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:58:09,279 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 01:58:09,282 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:58:09,537 INFO L349 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2024-11-09 01:58:09,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2024-11-09 01:58:09,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-09 01:58:09,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2024-11-09 01:58:09,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2024-11-09 01:58:09,949 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-09 01:58:09,949 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 55 treesize of output 31 [2024-11-09 01:58:09,983 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 01:58:09,983 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:58:09,984 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:58:09,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [991610296] [2024-11-09 01:58:09,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [991610296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:58:09,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:58:09,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 01:58:09,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46615048] [2024-11-09 01:58:09,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:58:09,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 01:58:09,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:58:09,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 01:58:09,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:58:09,985 INFO L87 Difference]: Start difference. First operand 435 states and 572 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 01:58:11,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:58:11,200 INFO L93 Difference]: Finished difference Result 963 states and 1264 transitions. [2024-11-09 01:58:11,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:58:11,201 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 62 [2024-11-09 01:58:11,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:58:11,204 INFO L225 Difference]: With dead ends: 963 [2024-11-09 01:58:11,204 INFO L226 Difference]: Without dead ends: 531 [2024-11-09 01:58:11,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2024-11-09 01:58:11,206 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 344 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 01:58:11,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 544 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 01:58:11,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2024-11-09 01:58:11,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 329. [2024-11-09 01:58:11,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 302 states have (on average 1.3178807947019868) internal successors, (398), 304 states have internal predecessors, (398), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 01:58:11,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 438 transitions. [2024-11-09 01:58:11,247 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 438 transitions. Word has length 62 [2024-11-09 01:58:11,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:58:11,248 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 438 transitions. [2024-11-09 01:58:11,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 01:58:11,248 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 438 transitions. [2024-11-09 01:58:11,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-09 01:58:11,249 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:58:11,249 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:58:11,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-09 01:58:11,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:58:11,450 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:58:11,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:58:11,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1561577064, now seen corresponding path program 1 times [2024-11-09 01:58:11,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:58:11,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [669744178] [2024-11-09 01:58:11,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:58:11,451 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-09 01:58:11,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:58:11,453 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:58:11,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-09 01:58:11,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:58:11,656 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 01:58:11,657 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:58:11,668 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 01:58:11,668 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:58:11,668 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:58:11,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [669744178] [2024-11-09 01:58:11,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [669744178] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:58:11,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:58:11,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:58:11,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843436315] [2024-11-09 01:58:11,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:58:11,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:58:11,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:58:11,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:58:11,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:58:11,670 INFO L87 Difference]: Start difference. First operand 329 states and 438 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 01:58:11,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:58:11,743 INFO L93 Difference]: Finished difference Result 655 states and 873 transitions. [2024-11-09 01:58:11,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:58:11,744 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 62 [2024-11-09 01:58:11,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:58:11,746 INFO L225 Difference]: With dead ends: 655 [2024-11-09 01:58:11,746 INFO L226 Difference]: Without dead ends: 329 [2024-11-09 01:58:11,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 59 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-09 01:58:11,748 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 0 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 262 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-09 01:58:11,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 262 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:58:11,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2024-11-09 01:58:11,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 329. [2024-11-09 01:58:11,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 302 states have (on average 1.3112582781456954) internal successors, (396), 304 states have internal predecessors, (396), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 01:58:11,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 436 transitions. [2024-11-09 01:58:11,782 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 436 transitions. Word has length 62 [2024-11-09 01:58:11,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:58:11,782 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 436 transitions. [2024-11-09 01:58:11,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 01:58:11,783 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 436 transitions. [2024-11-09 01:58:11,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-09 01:58:11,785 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:58:11,785 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:58:11,792 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-09 01:58:11,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:58:11,985 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:58:11,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:58:11,986 INFO L85 PathProgramCache]: Analyzing trace with hash 790882118, now seen corresponding path program 1 times [2024-11-09 01:58:11,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:58:11,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1611403795] [2024-11-09 01:58:11,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:58:11,987 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-09 01:58:11,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:58:11,989 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:58:11,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-09 01:58:12,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:58:12,274 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 01:58:12,277 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:58:12,497 INFO L349 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2024-11-09 01:58:12,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2024-11-09 01:58:12,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-09 01:58:12,755 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 01:58:12,755 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:58:12,756 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:58:12,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1611403795] [2024-11-09 01:58:12,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1611403795] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:58:12,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:58:12,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 01:58:12,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087030498] [2024-11-09 01:58:12,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:58:12,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 01:58:12,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:58:12,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 01:58:12,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:58:12,757 INFO L87 Difference]: Start difference. First operand 329 states and 436 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 01:58:13,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:58:13,342 INFO L93 Difference]: Finished difference Result 382 states and 502 transitions. [2024-11-09 01:58:13,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:58:13,344 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 64 [2024-11-09 01:58:13,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:58:13,347 INFO L225 Difference]: With dead ends: 382 [2024-11-09 01:58:13,347 INFO L226 Difference]: Without dead ends: 380 [2024-11-09 01:58:13,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2024-11-09 01:58:13,348 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 272 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 01:58:13,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 642 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 01:58:13,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2024-11-09 01:58:13,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 335. [2024-11-09 01:58:13,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 308 states have (on average 1.3051948051948052) internal successors, (402), 310 states have internal predecessors, (402), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 01:58:13,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 442 transitions. [2024-11-09 01:58:13,385 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 442 transitions. Word has length 64 [2024-11-09 01:58:13,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:58:13,386 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 442 transitions. [2024-11-09 01:58:13,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 01:58:13,387 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 442 transitions. [2024-11-09 01:58:13,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-09 01:58:13,389 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:58:13,389 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:58:13,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-11-09 01:58:13,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:58:13,592 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:58:13,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:58:13,593 INFO L85 PathProgramCache]: Analyzing trace with hash 792729160, now seen corresponding path program 1 times [2024-11-09 01:58:13,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:58:13,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [995698070] [2024-11-09 01:58:13,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:58:13,593 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-09 01:58:13,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:58:13,594 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:58:13,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-09 01:58:13,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:58:13,809 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 01:58:13,816 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:58:14,035 INFO L349 Elim1Store]: treesize reduction 26, result has 21.2 percent of original size [2024-11-09 01:58:14,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 24 [2024-11-09 01:58:14,228 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-09 01:58:14,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 34 [2024-11-09 01:58:14,261 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 01:58:14,262 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:58:14,262 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:58:14,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [995698070] [2024-11-09 01:58:14,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [995698070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:58:14,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:58:14,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 01:58:14,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591233525] [2024-11-09 01:58:14,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:58:14,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 01:58:14,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:58:14,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 01:58:14,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:58:14,263 INFO L87 Difference]: Start difference. First operand 335 states and 442 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 01:58:14,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:58:14,559 INFO L93 Difference]: Finished difference Result 679 states and 896 transitions. [2024-11-09 01:58:14,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:58:14,560 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 64 [2024-11-09 01:58:14,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:58:14,563 INFO L225 Difference]: With dead ends: 679 [2024-11-09 01:58:14,563 INFO L226 Difference]: Without dead ends: 347 [2024-11-09 01:58:14,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-11-09 01:58:14,565 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 197 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:58:14,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 430 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:58:14,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2024-11-09 01:58:14,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 341. [2024-11-09 01:58:14,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 314 states have (on average 1.2993630573248407) internal successors, (408), 316 states have internal predecessors, (408), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 01:58:14,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 448 transitions. [2024-11-09 01:58:14,598 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 448 transitions. Word has length 64 [2024-11-09 01:58:14,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:58:14,598 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 448 transitions. [2024-11-09 01:58:14,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 01:58:14,598 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 448 transitions. [2024-11-09 01:58:14,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-09 01:58:14,599 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:58:14,599 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:58:14,609 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 (14)] Forceful destruction successful, exit code 0 [2024-11-09 01:58:14,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:58:14,800 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:58:14,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:58:14,800 INFO L85 PathProgramCache]: Analyzing trace with hash 198670215, now seen corresponding path program 1 times [2024-11-09 01:58:14,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:58:14,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [741075254] [2024-11-09 01:58:14,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:58:14,801 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-09 01:58:14,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:58:14,802 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:58:14,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-09 01:58:15,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:58:15,010 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 01:58:15,012 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:58:15,201 INFO L349 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2024-11-09 01:58:15,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2024-11-09 01:58:15,254 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-09 01:58:15,255 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 30 treesize of output 14 [2024-11-09 01:58:15,266 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 01:58:15,266 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:58:15,267 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:58:15,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [741075254] [2024-11-09 01:58:15,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [741075254] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:58:15,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:58:15,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:58:15,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322965201] [2024-11-09 01:58:15,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:58:15,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:58:15,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:58:15,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:58:15,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:58:15,268 INFO L87 Difference]: Start difference. First operand 341 states and 448 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 01:58:15,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:58:15,641 INFO L93 Difference]: Finished difference Result 639 states and 838 transitions. [2024-11-09 01:58:15,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:58:15,642 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 64 [2024-11-09 01:58:15,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:58:15,644 INFO L225 Difference]: With dead ends: 639 [2024-11-09 01:58:15,644 INFO L226 Difference]: Without dead ends: 301 [2024-11-09 01:58:15,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:58:15,646 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 178 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:58:15,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 379 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:58:15,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-11-09 01:58:15,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 295. [2024-11-09 01:58:15,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 268 states have (on average 1.2761194029850746) internal successors, (342), 270 states have internal predecessors, (342), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 01:58:15,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 382 transitions. [2024-11-09 01:58:15,687 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 382 transitions. Word has length 64 [2024-11-09 01:58:15,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:58:15,688 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 382 transitions. [2024-11-09 01:58:15,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 01:58:15,688 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 382 transitions. [2024-11-09 01:58:15,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-09 01:58:15,689 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:58:15,689 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:58:15,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-09 01:58:15,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:58:15,890 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:58:15,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:58:15,890 INFO L85 PathProgramCache]: Analyzing trace with hash -464165963, now seen corresponding path program 1 times [2024-11-09 01:58:15,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:58:15,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [721416300] [2024-11-09 01:58:15,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:58:15,891 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-09 01:58:15,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:58:15,892 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:58:15,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-09 01:58:16,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:58:16,088 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 01:58:16,091 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:58:16,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-09 01:58:16,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-09 01:58:16,232 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 01:58:16,233 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:58:16,233 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:58:16,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [721416300] [2024-11-09 01:58:16,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [721416300] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:58:16,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:58:16,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:58:16,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123142216] [2024-11-09 01:58:16,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:58:16,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:58:16,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:58:16,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:58:16,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:58:16,234 INFO L87 Difference]: Start difference. First operand 295 states and 382 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 01:58:16,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:58:16,494 INFO L93 Difference]: Finished difference Result 707 states and 913 transitions. [2024-11-09 01:58:16,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:58:16,495 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 64 [2024-11-09 01:58:16,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:58:16,497 INFO L225 Difference]: With dead ends: 707 [2024-11-09 01:58:16,497 INFO L226 Difference]: Without dead ends: 415 [2024-11-09 01:58:16,498 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:58:16,499 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 74 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:58:16,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 279 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:58:16,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2024-11-09 01:58:16,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 392. [2024-11-09 01:58:16,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 357 states have (on average 1.2745098039215685) internal successors, (455), 359 states have internal predecessors, (455), 26 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-09 01:58:16,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 507 transitions. [2024-11-09 01:58:16,566 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 507 transitions. Word has length 64 [2024-11-09 01:58:16,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:58:16,566 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 507 transitions. [2024-11-09 01:58:16,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 01:58:16,567 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 507 transitions. [2024-11-09 01:58:16,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-09 01:58:16,567 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:58:16,568 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:58:16,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-09 01:58:16,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:58:16,768 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:58:16,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:58:16,769 INFO L85 PathProgramCache]: Analyzing trace with hash 651977882, now seen corresponding path program 1 times [2024-11-09 01:58:16,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:58:16,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1172885102] [2024-11-09 01:58:16,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:58:16,769 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-09 01:58:16,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:58:16,771 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:58:16,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-09 01:58:16,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:58:16,979 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 01:58:16,981 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:58:17,000 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-09 01:58:17,000 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:58:17,000 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:58:17,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1172885102] [2024-11-09 01:58:17,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1172885102] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:58:17,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:58:17,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:58:17,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599824188] [2024-11-09 01:58:17,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:58:17,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:58:17,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:58:17,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:58:17,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:58:17,002 INFO L87 Difference]: Start difference. First operand 392 states and 507 transitions. Second operand has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 01:58:17,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:58:17,128 INFO L93 Difference]: Finished difference Result 735 states and 951 transitions. [2024-11-09 01:58:17,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:58:17,129 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 64 [2024-11-09 01:58:17,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:58:17,133 INFO L225 Difference]: With dead ends: 735 [2024-11-09 01:58:17,133 INFO L226 Difference]: Without dead ends: 402 [2024-11-09 01:58:17,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 59 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-09 01:58:17,134 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 1 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:58:17,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 400 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:58:17,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2024-11-09 01:58:17,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 392. [2024-11-09 01:58:17,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 357 states have (on average 1.2661064425770308) internal successors, (452), 359 states have internal predecessors, (452), 26 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-09 01:58:17,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 504 transitions. [2024-11-09 01:58:17,187 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 504 transitions. Word has length 64 [2024-11-09 01:58:17,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:58:17,187 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 504 transitions. [2024-11-09 01:58:17,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 01:58:17,188 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 504 transitions. [2024-11-09 01:58:17,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-09 01:58:17,188 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:58:17,188 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:58:17,199 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 (17)] Forceful destruction successful, exit code 0 [2024-11-09 01:58:17,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:58:17,393 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:58:17,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:58:17,394 INFO L85 PathProgramCache]: Analyzing trace with hash 377218268, now seen corresponding path program 1 times [2024-11-09 01:58:17,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:58:17,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1412830395] [2024-11-09 01:58:17,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:58:17,394 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-09 01:58:17,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:58:17,397 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:58:17,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-09 01:58:17,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:58:17,769 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-09 01:58:17,772 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:58:18,346 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 18 treesize of output 19 [2024-11-09 01:58:18,694 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:58:18,694 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 200 treesize of output 130 [2024-11-09 01:58:18,701 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:58:18,701 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 283 treesize of output 133 [2024-11-09 01:58:18,777 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 01:58:18,778 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:58:19,075 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:58:19,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1412830395] [2024-11-09 01:58:19,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1412830395] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:58:19,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [246577434] [2024-11-09 01:58:19,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:58:19,075 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 01:58:19,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-09 01:58:19,077 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 01:58:19,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2024-11-09 01:58:20,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:58:20,017 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-09 01:58:20,020 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:58:20,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 1 [2024-11-09 01:58:21,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-11-09 01:58:21,735 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:58:21,735 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 174 treesize of output 118 [2024-11-09 01:58:21,742 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 0 case distinctions, treesize of input 253 treesize of output 133 [2024-11-09 01:58:21,764 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 01:58:21,764 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:58:21,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [246577434] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:58:21,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 01:58:21,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2024-11-09 01:58:21,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426788707] [2024-11-09 01:58:21,888 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 01:58:21,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-09 01:58:21,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:58:21,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-09 01:58:21,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=487, Unknown=0, NotChecked=0, Total=600 [2024-11-09 01:58:21,889 INFO L87 Difference]: Start difference. First operand 392 states and 504 transitions. Second operand has 22 states, 20 states have (on average 4.1) internal successors, (82), 19 states have internal predecessors, (82), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-09 01:58:23,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:58:23,771 INFO L93 Difference]: Finished difference Result 704 states and 897 transitions. [2024-11-09 01:58:23,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-09 01:58:23,772 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 4.1) internal successors, (82), 19 states have internal predecessors, (82), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 64 [2024-11-09 01:58:23,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:58:23,775 INFO L225 Difference]: With dead ends: 704 [2024-11-09 01:58:23,775 INFO L226 Difference]: Without dead ends: 412 [2024-11-09 01:58:23,777 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 153 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=357, Invalid=1283, Unknown=0, NotChecked=0, Total=1640 [2024-11-09 01:58:23,778 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 222 mSDsluCounter, 912 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 1042 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 01:58:23,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 1042 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 01:58:23,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2024-11-09 01:58:23,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 222. [2024-11-09 01:58:23,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 200 states have (on average 1.245) internal successors, (249), 200 states have internal predecessors, (249), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 01:58:23,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 279 transitions. [2024-11-09 01:58:23,823 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 279 transitions. Word has length 64 [2024-11-09 01:58:23,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:58:23,824 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 279 transitions. [2024-11-09 01:58:23,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 4.1) internal successors, (82), 19 states have internal predecessors, (82), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-09 01:58:23,824 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 279 transitions. [2024-11-09 01:58:23,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-09 01:58:23,825 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:58:23,825 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:58:23,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Ended with exit code 0 [2024-11-09 01:58:24,034 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 (18)] Forceful destruction successful, exit code 0 [2024-11-09 01:58:24,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,18 /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-09 01:58:24,226 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:58:24,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:58:24,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1143891913, now seen corresponding path program 1 times [2024-11-09 01:58:24,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:58:24,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1979385764] [2024-11-09 01:58:24,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:58:24,227 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-09 01:58:24,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:58:24,230 INFO L229 MonitoredProcess]: Starting monitored process 20 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-09 01:58:24,232 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 (20)] Waiting until timeout for monitored process [2024-11-09 01:58:24,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:58:24,577 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-09 01:58:24,582 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:58:25,304 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 26 treesize of output 14 [2024-11-09 01:58:25,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 54 [2024-11-09 01:58:25,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2024-11-09 01:58:25,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2024-11-09 01:58:26,169 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 21 proven. 117 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-11-09 01:58:26,169 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:58:26,451 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:58:26,451 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 35 treesize of output 38 [2024-11-09 01:58:27,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 99 [2024-11-09 01:58:28,424 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:58:28,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1979385764] [2024-11-09 01:58:28,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1979385764] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:58:28,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1323541085] [2024-11-09 01:58:28,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:58:28,425 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 01:58:28,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-09 01:58:28,426 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 01:58:28,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2024-11-09 01:58:29,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:58:29,624 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-09 01:58:29,628 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:58:31,330 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 26 treesize of output 14 [2024-11-09 01:58:31,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 35 [2024-11-09 01:58:31,761 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 13 treesize of output 9 [2024-11-09 01:58:32,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-09 01:58:32,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2024-11-09 01:58:32,703 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 21 proven. 117 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-11-09 01:58:32,703 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:58:32,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2024-11-09 01:58:33,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 99 [2024-11-09 01:58:33,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1323541085] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:58:33,724 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 01:58:33,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2024-11-09 01:58:33,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356733654] [2024-11-09 01:58:33,724 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 01:58:33,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 01:58:33,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:58:33,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 01:58:33,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2024-11-09 01:58:33,726 INFO L87 Difference]: Start difference. First operand 222 states and 279 transitions. Second operand has 16 states, 16 states have (on average 7.75) internal successors, (124), 15 states have internal predecessors, (124), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-09 01:58:36,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:58:36,749 INFO L93 Difference]: Finished difference Result 502 states and 622 transitions. [2024-11-09 01:58:36,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 01:58:36,750 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.75) internal successors, (124), 15 states have internal predecessors, (124), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 125 [2024-11-09 01:58:36,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:58:36,752 INFO L225 Difference]: With dead ends: 502 [2024-11-09 01:58:36,752 INFO L226 Difference]: Without dead ends: 344 [2024-11-09 01:58:36,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 398 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=270, Invalid=920, Unknown=0, NotChecked=0, Total=1190 [2024-11-09 01:58:36,753 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 271 mSDsluCounter, 822 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-09 01:58:36,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 937 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-09 01:58:36,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2024-11-09 01:58:36,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 253. [2024-11-09 01:58:36,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 231 states have (on average 1.2294372294372293) internal successors, (284), 231 states have internal predecessors, (284), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 01:58:36,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 314 transitions. [2024-11-09 01:58:36,809 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 314 transitions. Word has length 125 [2024-11-09 01:58:36,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:58:36,810 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 314 transitions. [2024-11-09 01:58:36,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.75) internal successors, (124), 15 states have internal predecessors, (124), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-09 01:58:36,810 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 314 transitions. [2024-11-09 01:58:36,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-09 01:58:36,811 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:58:36,812 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 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-09 01:58:36,824 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 (20)] Ended with exit code 0 [2024-11-09 01:58:37,024 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Forceful destruction successful, exit code 0 [2024-11-09 01:58:37,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-09 01:58:37,212 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:58:37,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:58:37,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1299010039, now seen corresponding path program 1 times [2024-11-09 01:58:37,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:58:37,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1287712382] [2024-11-09 01:58:37,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:58:37,214 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-09 01:58:37,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:58:37,215 INFO L229 MonitoredProcess]: Starting monitored process 22 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-09 01:58:37,216 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 (22)] Waiting until timeout for monitored process [2024-11-09 01:58:37,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:58:37,655 INFO L255 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-09 01:58:37,660 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:58:38,849 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 26 treesize of output 14 [2024-11-09 01:58:38,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-09 01:58:40,137 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 83 treesize of output 55 [2024-11-09 01:58:40,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 42 [2024-11-09 01:58:40,218 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 28 treesize of output 20 [2024-11-09 01:58:40,287 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 25 treesize of output 21 [2024-11-09 01:58:40,681 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 18 proven. 120 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-11-09 01:58:40,681 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:58:41,202 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2024-11-09 01:58:41,202 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:58:41,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1287712382] [2024-11-09 01:58:41,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1287712382] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 01:58:41,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 01:58:41,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 19 [2024-11-09 01:58:41,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160083510] [2024-11-09 01:58:41,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:58:41,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 01:58:41,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:58:41,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 01:58:41,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2024-11-09 01:58:41,204 INFO L87 Difference]: Start difference. First operand 253 states and 314 transitions. Second operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 01:58:41,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:58:41,537 INFO L93 Difference]: Finished difference Result 444 states and 553 transitions. [2024-11-09 01:58:41,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 01:58:41,538 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 125 [2024-11-09 01:58:41,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:58:41,540 INFO L225 Difference]: With dead ends: 444 [2024-11-09 01:58:41,540 INFO L226 Difference]: Without dead ends: 362 [2024-11-09 01:58:41,540 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 231 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=66, Invalid=396, Unknown=0, NotChecked=0, Total=462 [2024-11-09 01:58:41,541 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 148 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:58:41,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 603 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:58:41,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2024-11-09 01:58:41,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 272. [2024-11-09 01:58:41,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 250 states have (on average 1.252) internal successors, (313), 250 states have internal predecessors, (313), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 01:58:41,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 343 transitions. [2024-11-09 01:58:41,602 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 343 transitions. Word has length 125 [2024-11-09 01:58:41,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:58:41,603 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 343 transitions. [2024-11-09 01:58:41,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 01:58:41,603 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 343 transitions. [2024-11-09 01:58:41,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-09 01:58:41,605 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:58:41,605 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-09 01:58:41,619 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 (22)] Ended with exit code 0 [2024-11-09 01:58:41,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /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-09 01:58:41,806 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:58:41,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:58:41,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1721711865, now seen corresponding path program 1 times [2024-11-09 01:58:41,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:58:41,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [372754137] [2024-11-09 01:58:41,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:58:41,807 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-09 01:58:41,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:58:41,811 INFO L229 MonitoredProcess]: Starting monitored process 23 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-09 01:58:41,813 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 (23)] Waiting until timeout for monitored process [2024-11-09 01:58:42,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:58:42,260 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-09 01:58:42,266 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:58:43,484 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 26 treesize of output 14 [2024-11-09 01:58:43,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-09 01:58:44,821 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 83 treesize of output 55 [2024-11-09 01:58:44,888 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 28 treesize of output 20 [2024-11-09 01:58:45,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-11-09 01:58:45,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 36 [2024-11-09 01:58:45,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 77 [2024-11-09 01:58:45,282 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 13 proven. 125 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-11-09 01:58:45,282 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:58:50,097 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:58:50,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [372754137] [2024-11-09 01:58:50,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [372754137] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:58:50,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [636589340] [2024-11-09 01:58:50,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:58:50,098 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 01:58:50,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-09 01:58:50,099 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 01:58:50,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2024-11-09 01:58:51,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:58:51,209 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-09 01:58:51,214 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:58:52,601 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 26 treesize of output 14 [2024-11-09 01:58:52,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-09 01:58:54,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 50 [2024-11-09 01:58:55,512 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 28 treesize of output 20 [2024-11-09 01:58:56,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2024-11-09 01:58:56,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-11-09 01:58:56,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 32 [2024-11-09 01:58:56,588 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 13 proven. 125 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-11-09 01:58:56,588 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:58:56,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 54 [2024-11-09 01:58:58,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [636589340] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:58:58,457 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 01:58:58,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 23 [2024-11-09 01:58:58,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49716688] [2024-11-09 01:58:58,457 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 01:58:58,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-09 01:58:58,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:58:58,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-09 01:58:58,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=933, Unknown=0, NotChecked=0, Total=1056 [2024-11-09 01:58:58,459 INFO L87 Difference]: Start difference. First operand 272 states and 343 transitions. Second operand has 24 states, 24 states have (on average 6.208333333333333) internal successors, (149), 23 states have internal predecessors, (149), 4 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-09 01:59:01,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:59:01,625 INFO L93 Difference]: Finished difference Result 590 states and 748 transitions. [2024-11-09 01:59:01,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 01:59:01,626 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 6.208333333333333) internal successors, (149), 23 states have internal predecessors, (149), 4 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) Word has length 125 [2024-11-09 01:59:01,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:59:01,628 INFO L225 Difference]: With dead ends: 590 [2024-11-09 01:59:01,628 INFO L226 Difference]: Without dead ends: 489 [2024-11-09 01:59:01,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 271 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=246, Invalid=1560, Unknown=0, NotChecked=0, Total=1806 [2024-11-09 01:59:01,629 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 566 mSDsluCounter, 1501 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 1641 SdHoareTripleChecker+Invalid, 1074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-09 01:59:01,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [566 Valid, 1641 Invalid, 1074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1034 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-09 01:59:01,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2024-11-09 01:59:01,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 293. [2024-11-09 01:59:01,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 271 states have (on average 1.2656826568265682) internal successors, (343), 271 states have internal predecessors, (343), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 01:59:01,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 373 transitions. [2024-11-09 01:59:01,684 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 373 transitions. Word has length 125 [2024-11-09 01:59:01,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:59:01,685 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 373 transitions. [2024-11-09 01:59:01,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 6.208333333333333) internal successors, (149), 23 states have internal predecessors, (149), 4 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-09 01:59:01,685 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 373 transitions. [2024-11-09 01:59:01,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-09 01:59:01,686 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:59:01,686 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-09 01:59:01,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Forceful destruction successful, exit code 0 [2024-11-09 01:59:01,897 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 (23)] Ended with exit code 0 [2024-11-09 01:59:02,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,23 /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-09 01:59:02,087 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:59:02,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:59:02,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1587698359, now seen corresponding path program 1 times [2024-11-09 01:59:02,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:59:02,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1095652254] [2024-11-09 01:59:02,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:59:02,088 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-09 01:59:02,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:59:02,089 INFO L229 MonitoredProcess]: Starting monitored process 25 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-09 01:59:02,090 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 (25)] Waiting until timeout for monitored process [2024-11-09 01:59:02,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:59:02,488 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-09 01:59:02,493 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:59:03,570 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 26 treesize of output 14 [2024-11-09 01:59:03,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13