./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-48.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-48.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 b209b13322483f0de6355983dfc45de7dda6e23f708a5a679f61eb11dccb6a42 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:35:50,442 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:35:50,502 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 00:35:50,506 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:35:50,507 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:35:50,525 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:35:50,526 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:35:50,526 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:35:50,526 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:35:50,526 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:35:50,527 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:35:50,527 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:35:50,529 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:35:50,530 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:35:50,530 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:35:50,531 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:35:50,531 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:35:50,531 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:35:50,531 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 00:35:50,531 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:35:50,531 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:35:50,534 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:35:50,534 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:35:50,535 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:35:50,535 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:35:50,535 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:35:50,535 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:35:50,535 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:35:50,536 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:35:50,536 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:35:50,537 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:35:50,537 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:35:50,537 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:35:50,537 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:35:50,537 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:35:50,538 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:35:50,538 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 00:35:50,538 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 00:35:50,538 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:35:50,538 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:35:50,538 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:35:50,539 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:35:50,539 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 -> b209b13322483f0de6355983dfc45de7dda6e23f708a5a679f61eb11dccb6a42 [2024-11-19 00:35:50,744 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:35:50,764 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:35:50,766 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:35:50,767 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:35:50,767 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:35:50,768 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-48.i [2024-11-19 00:35:52,051 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:35:52,227 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:35:52,228 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-48.i [2024-11-19 00:35:52,237 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f9c6ef66/0f5ab7e847d14a5e97747d17e74c96eb/FLAG316a677cd [2024-11-19 00:35:52,609 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f9c6ef66/0f5ab7e847d14a5e97747d17e74c96eb [2024-11-19 00:35:52,610 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:35:52,611 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:35:52,613 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:35:52,613 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:35:52,618 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:35:52,618 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:35:52" (1/1) ... [2024-11-19 00:35:52,620 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@771875ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:52, skipping insertion in model container [2024-11-19 00:35:52,620 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:35:52" (1/1) ... [2024-11-19 00:35:52,641 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:35:52,762 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-48.i[916,929] [2024-11-19 00:35:52,812 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:35:52,820 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:35:52,829 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-48.i[916,929] [2024-11-19 00:35:52,882 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:35:52,899 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:35:52,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:52 WrapperNode [2024-11-19 00:35:52,899 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:35:52,902 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:35:52,903 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:35:52,903 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:35:52,908 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:52" (1/1) ... [2024-11-19 00:35:52,921 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:52" (1/1) ... [2024-11-19 00:35:52,994 INFO L138 Inliner]: procedures = 29, calls = 180, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 503 [2024-11-19 00:35:52,994 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:35:52,995 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:35:52,995 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:35:52,995 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:35:53,005 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:52" (1/1) ... [2024-11-19 00:35:53,005 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:52" (1/1) ... [2024-11-19 00:35:53,009 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:52" (1/1) ... [2024-11-19 00:35:53,027 INFO L175 MemorySlicer]: Split 143 memory accesses to 6 slices as follows [2, 15, 53, 5, 65, 3]. 45 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [2, 2, 6, 1, 9, 1]. The 23 writes are split as follows [0, 3, 8, 1, 10, 1]. [2024-11-19 00:35:53,028 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:52" (1/1) ... [2024-11-19 00:35:53,028 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:52" (1/1) ... [2024-11-19 00:35:53,042 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:52" (1/1) ... [2024-11-19 00:35:53,049 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:52" (1/1) ... [2024-11-19 00:35:53,054 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:52" (1/1) ... [2024-11-19 00:35:53,057 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:52" (1/1) ... [2024-11-19 00:35:53,066 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:35:53,067 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:35:53,067 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:35:53,067 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:35:53,068 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:52" (1/1) ... [2024-11-19 00:35:53,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:35:53,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:35:53,098 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-19 00:35:53,099 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-19 00:35:53,137 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:35:53,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 00:35:53,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 00:35:53,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 00:35:53,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-19 00:35:53,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-19 00:35:53,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-19 00:35:53,138 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-19 00:35:53,138 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-19 00:35:53,138 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-19 00:35:53,138 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-19 00:35:53,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-19 00:35:53,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-19 00:35:53,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-19 00:35:53,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-19 00:35:53,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-19 00:35:53,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-19 00:35:53,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-19 00:35:53,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-19 00:35:53,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 00:35:53,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 00:35:53,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 00:35:53,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-19 00:35:53,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-19 00:35:53,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-19 00:35:53,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-19 00:35:53,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-19 00:35:53,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-19 00:35:53,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-19 00:35:53,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-19 00:35:53,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-19 00:35:53,140 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:35:53,140 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:35:53,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 00:35:53,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 00:35:53,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 00:35:53,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-19 00:35:53,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-19 00:35:53,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-19 00:35:53,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:35:53,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:35:53,248 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:35:53,249 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:35:53,610 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2024-11-19 00:35:53,610 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:35:53,625 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:35:53,625 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:35:53,626 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:35:53 BoogieIcfgContainer [2024-11-19 00:35:53,626 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:35:53,627 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:35:53,628 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:35:53,630 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:35:53,630 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:35:52" (1/3) ... [2024-11-19 00:35:53,630 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60232015 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:35:53, skipping insertion in model container [2024-11-19 00:35:53,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:52" (2/3) ... [2024-11-19 00:35:53,631 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60232015 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:35:53, skipping insertion in model container [2024-11-19 00:35:53,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:35:53" (3/3) ... [2024-11-19 00:35:53,632 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-48.i [2024-11-19 00:35:53,644 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:35:53,645 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:35:53,690 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:35:53,694 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;@43de197a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:35:53,695 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:35:53,698 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 94 states have (on average 1.3936170212765957) internal successors, (131), 95 states have internal predecessors, (131), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-19 00:35:53,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-19 00:35:53,710 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:35:53,710 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:35:53,710 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:35:53,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:35:53,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1009184855, now seen corresponding path program 1 times [2024-11-19 00:35:53,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:35:53,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847806652] [2024-11-19 00:35:53,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:53,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:35:53,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:54,022 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2024-11-19 00:35:54,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:35:54,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847806652] [2024-11-19 00:35:54,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847806652] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:35:54,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999037204] [2024-11-19 00:35:54,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:54,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:35:54,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:35:54,029 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-19 00:35:54,031 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-19 00:35:54,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:54,266 INFO L255 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:35:54,297 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:35:54,326 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2024-11-19 00:35:54,329 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:35:54,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [999037204] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:35:54,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:35:54,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-19 00:35:54,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445075393] [2024-11-19 00:35:54,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:35:54,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:35:54,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:35:54,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:35:54,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:35:54,361 INFO L87 Difference]: Start difference. First operand has 118 states, 94 states have (on average 1.3936170212765957) internal successors, (131), 95 states have internal predecessors, (131), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-19 00:35:54,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:35:54,383 INFO L93 Difference]: Finished difference Result 229 states and 361 transitions. [2024-11-19 00:35:54,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:35:54,385 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 168 [2024-11-19 00:35:54,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:35:54,390 INFO L225 Difference]: With dead ends: 229 [2024-11-19 00:35:54,390 INFO L226 Difference]: Without dead ends: 114 [2024-11-19 00:35:54,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 169 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-19 00:35:54,396 INFO L432 NwaCegarLoop]: 164 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, 164 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-19 00:35:54,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:35:54,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-19 00:35:54,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-11-19 00:35:54,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 91 states have (on average 1.3406593406593406) internal successors, (122), 91 states have internal predecessors, (122), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-19 00:35:54,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 164 transitions. [2024-11-19 00:35:54,430 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 164 transitions. Word has length 168 [2024-11-19 00:35:54,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:35:54,431 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 164 transitions. [2024-11-19 00:35:54,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-19 00:35:54,431 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 164 transitions. [2024-11-19 00:35:54,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-19 00:35:54,433 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:35:54,434 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:35:54,448 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-19 00:35:54,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-19 00:35:54,635 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:35:54,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:35:54,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1949683919, now seen corresponding path program 1 times [2024-11-19 00:35:54,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:35:54,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95386433] [2024-11-19 00:35:54,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:54,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:35:54,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:54,870 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-19 00:35:54,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:35:54,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95386433] [2024-11-19 00:35:54,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95386433] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:35:54,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:35:54,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:35:54,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107687549] [2024-11-19 00:35:54,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:35:54,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:35:54,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:35:54,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:35:54,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:35:54,875 INFO L87 Difference]: Start difference. First operand 114 states and 164 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-19 00:35:54,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:35:54,912 INFO L93 Difference]: Finished difference Result 227 states and 328 transitions. [2024-11-19 00:35:54,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:35:54,914 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 168 [2024-11-19 00:35:54,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:35:54,915 INFO L225 Difference]: With dead ends: 227 [2024-11-19 00:35:54,915 INFO L226 Difference]: Without dead ends: 116 [2024-11-19 00:35:54,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:35:54,918 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 0 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:35:54,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 475 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:35:54,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-19 00:35:54,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-19 00:35:54,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 93 states have (on average 1.3333333333333333) internal successors, (124), 93 states have internal predecessors, (124), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-19 00:35:54,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 166 transitions. [2024-11-19 00:35:54,940 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 166 transitions. Word has length 168 [2024-11-19 00:35:54,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:35:54,941 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 166 transitions. [2024-11-19 00:35:54,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-19 00:35:54,942 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 166 transitions. [2024-11-19 00:35:54,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-19 00:35:54,946 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:35:54,946 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:35:54,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 00:35:54,946 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:35:54,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:35:54,947 INFO L85 PathProgramCache]: Analyzing trace with hash 503103053, now seen corresponding path program 1 times [2024-11-19 00:35:54,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:35:54,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005860581] [2024-11-19 00:35:54,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:54,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:35:55,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:55,144 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-19 00:35:55,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:35:55,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005860581] [2024-11-19 00:35:55,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005860581] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:35:55,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:35:55,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:35:55,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098732000] [2024-11-19 00:35:55,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:35:55,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:35:55,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:35:55,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:35:55,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:35:55,149 INFO L87 Difference]: Start difference. First operand 116 states and 166 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-19 00:35:55,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:35:55,184 INFO L93 Difference]: Finished difference Result 232 states and 333 transitions. [2024-11-19 00:35:55,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:35:55,185 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2024-11-19 00:35:55,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:35:55,186 INFO L225 Difference]: With dead ends: 232 [2024-11-19 00:35:55,186 INFO L226 Difference]: Without dead ends: 119 [2024-11-19 00:35:55,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:35:55,189 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 1 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 472 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-19 00:35:55,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 472 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:35:55,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-19 00:35:55,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2024-11-19 00:35:55,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 95 states have (on average 1.3263157894736841) internal successors, (126), 95 states have internal predecessors, (126), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-19 00:35:55,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 168 transitions. [2024-11-19 00:35:55,201 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 168 transitions. Word has length 168 [2024-11-19 00:35:55,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:35:55,202 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 168 transitions. [2024-11-19 00:35:55,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-19 00:35:55,203 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 168 transitions. [2024-11-19 00:35:55,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-19 00:35:55,207 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:35:55,207 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:35:55,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 00:35:55,207 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:35:55,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:35:55,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1183161423, now seen corresponding path program 1 times [2024-11-19 00:35:55,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:35:55,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243640227] [2024-11-19 00:35:55,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:55,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:35:55,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:55,331 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-19 00:35:55,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:35:55,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243640227] [2024-11-19 00:35:55,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243640227] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:35:55,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:35:55,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:35:55,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342866494] [2024-11-19 00:35:55,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:35:55,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:35:55,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:35:55,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:35:55,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:35:55,337 INFO L87 Difference]: Start difference. First operand 118 states and 168 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-19 00:35:55,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:35:55,361 INFO L93 Difference]: Finished difference Result 236 states and 337 transitions. [2024-11-19 00:35:55,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:35:55,361 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2024-11-19 00:35:55,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:35:55,363 INFO L225 Difference]: With dead ends: 236 [2024-11-19 00:35:55,363 INFO L226 Difference]: Without dead ends: 121 [2024-11-19 00:35:55,366 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:35:55,366 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 1 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 473 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-19 00:35:55,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 473 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:35:55,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-19 00:35:55,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2024-11-19 00:35:55,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 97 states have (on average 1.3195876288659794) internal successors, (128), 97 states have internal predecessors, (128), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-19 00:35:55,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 170 transitions. [2024-11-19 00:35:55,379 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 170 transitions. Word has length 168 [2024-11-19 00:35:55,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:35:55,379 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 170 transitions. [2024-11-19 00:35:55,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-19 00:35:55,380 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 170 transitions. [2024-11-19 00:35:55,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-19 00:35:55,381 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:35:55,382 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:35:55,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 00:35:55,382 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:35:55,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:35:55,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1336798511, now seen corresponding path program 1 times [2024-11-19 00:35:55,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:35:55,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551800500] [2024-11-19 00:35:55,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:55,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:35:55,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:55,539 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-19 00:35:55,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:35:55,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551800500] [2024-11-19 00:35:55,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551800500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:35:55,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:35:55,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:35:55,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023556873] [2024-11-19 00:35:55,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:35:55,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:35:55,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:35:55,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:35:55,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:35:55,544 INFO L87 Difference]: Start difference. First operand 120 states and 170 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-19 00:35:55,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:35:55,568 INFO L93 Difference]: Finished difference Result 240 states and 341 transitions. [2024-11-19 00:35:55,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:35:55,568 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2024-11-19 00:35:55,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:35:55,571 INFO L225 Difference]: With dead ends: 240 [2024-11-19 00:35:55,571 INFO L226 Difference]: Without dead ends: 123 [2024-11-19 00:35:55,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:35:55,572 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 1 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:35:55,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 475 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:35:55,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-19 00:35:55,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2024-11-19 00:35:55,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 99 states have (on average 1.3131313131313131) internal successors, (130), 99 states have internal predecessors, (130), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-19 00:35:55,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 172 transitions. [2024-11-19 00:35:55,581 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 172 transitions. Word has length 168 [2024-11-19 00:35:55,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:35:55,581 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 172 transitions. [2024-11-19 00:35:55,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-19 00:35:55,581 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 172 transitions. [2024-11-19 00:35:55,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-19 00:35:55,583 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:35:55,583 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:35:55,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 00:35:55,583 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:35:55,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:35:55,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1334951469, now seen corresponding path program 1 times [2024-11-19 00:35:55,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:35:55,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495168895] [2024-11-19 00:35:55,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:55,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:35:55,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:57,369 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-19 00:35:57,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:35:57,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495168895] [2024-11-19 00:35:57,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495168895] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:35:57,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:35:57,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:35:57,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514840646] [2024-11-19 00:35:57,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:35:57,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:35:57,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:35:57,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:35:57,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:35:57,372 INFO L87 Difference]: Start difference. First operand 122 states and 172 transitions. Second operand has 6 states, 3 states have (on average 22.0) internal successors, (66), 6 states have internal predecessors, (66), 4 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 4 states have call successors, (21) [2024-11-19 00:35:57,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:35:57,465 INFO L93 Difference]: Finished difference Result 241 states and 341 transitions. [2024-11-19 00:35:57,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:35:57,465 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 3 states have (on average 22.0) internal successors, (66), 6 states have internal predecessors, (66), 4 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 4 states have call successors, (21) Word has length 168 [2024-11-19 00:35:57,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:35:57,466 INFO L225 Difference]: With dead ends: 241 [2024-11-19 00:35:57,467 INFO L226 Difference]: Without dead ends: 122 [2024-11-19 00:35:57,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:35:57,468 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 0 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:35:57,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 691 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:35:57,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-19 00:35:57,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-19 00:35:57,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 99 states have (on average 1.303030303030303) internal successors, (129), 99 states have internal predecessors, (129), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-19 00:35:57,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 171 transitions. [2024-11-19 00:35:57,474 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 171 transitions. Word has length 168 [2024-11-19 00:35:57,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:35:57,474 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 171 transitions. [2024-11-19 00:35:57,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 3 states have (on average 22.0) internal successors, (66), 6 states have internal predecessors, (66), 4 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 4 states have call successors, (21) [2024-11-19 00:35:57,474 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 171 transitions. [2024-11-19 00:35:57,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-19 00:35:57,476 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:35:57,476 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:35:57,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 00:35:57,476 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:35:57,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:35:57,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1271072085, now seen corresponding path program 1 times [2024-11-19 00:35:57,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:35:57,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244429133] [2024-11-19 00:35:57,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:57,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:35:57,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 00:35:57,562 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 00:35:57,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 00:35:57,677 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 00:35:57,677 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 00:35:57,679 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 00:35:57,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 00:35:57,682 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:35:57,764 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 00:35:57,767 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 12:35:57 BoogieIcfgContainer [2024-11-19 00:35:57,767 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 00:35:57,768 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 00:35:57,768 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 00:35:57,768 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 00:35:57,769 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:35:53" (3/4) ... [2024-11-19 00:35:57,770 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 00:35:57,771 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 00:35:57,772 INFO L158 Benchmark]: Toolchain (without parser) took 5160.25ms. Allocated memory was 186.6MB in the beginning and 318.8MB in the end (delta: 132.1MB). Free memory was 116.0MB in the beginning and 107.7MB in the end (delta: 8.3MB). Peak memory consumption was 143.0MB. Max. memory is 16.1GB. [2024-11-19 00:35:57,772 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 109.1MB. Free memory is still 68.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 00:35:57,772 INFO L158 Benchmark]: CACSL2BoogieTranslator took 288.91ms. Allocated memory is still 186.6MB. Free memory was 115.8MB in the beginning and 97.9MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-19 00:35:57,772 INFO L158 Benchmark]: Boogie Procedure Inliner took 92.37ms. Allocated memory is still 186.6MB. Free memory was 97.7MB in the beginning and 152.8MB in the end (delta: -55.1MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. [2024-11-19 00:35:57,772 INFO L158 Benchmark]: Boogie Preprocessor took 71.41ms. Allocated memory is still 186.6MB. Free memory was 152.8MB in the beginning and 146.7MB in the end (delta: 6.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-19 00:35:57,772 INFO L158 Benchmark]: RCFGBuilder took 558.89ms. Allocated memory is still 186.6MB. Free memory was 146.7MB in the beginning and 109.7MB in the end (delta: 37.0MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-11-19 00:35:57,773 INFO L158 Benchmark]: TraceAbstraction took 4140.47ms. Allocated memory was 186.6MB in the beginning and 318.8MB in the end (delta: 132.1MB). Free memory was 109.0MB in the beginning and 108.7MB in the end (delta: 257.5kB). Peak memory consumption was 133.1MB. Max. memory is 16.1GB. [2024-11-19 00:35:57,773 INFO L158 Benchmark]: Witness Printer took 3.42ms. Allocated memory is still 318.8MB. Free memory was 108.7MB in the beginning and 107.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 00:35:57,774 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.13ms. Allocated memory is still 109.1MB. Free memory is still 68.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 288.91ms. Allocated memory is still 186.6MB. Free memory was 115.8MB in the beginning and 97.9MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 92.37ms. Allocated memory is still 186.6MB. Free memory was 97.7MB in the beginning and 152.8MB in the end (delta: -55.1MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.41ms. Allocated memory is still 186.6MB. Free memory was 152.8MB in the beginning and 146.7MB in the end (delta: 6.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 558.89ms. Allocated memory is still 186.6MB. Free memory was 146.7MB in the beginning and 109.7MB in the end (delta: 37.0MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 4140.47ms. Allocated memory was 186.6MB in the beginning and 318.8MB in the end (delta: 132.1MB). Free memory was 109.0MB in the beginning and 108.7MB in the end (delta: 257.5kB). Peak memory consumption was 133.1MB. Max. memory is 16.1GB. * Witness Printer took 3.42ms. Allocated memory is still 318.8MB. Free memory was 108.7MB in the beginning and 107.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 107. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 0 }; [L25-L27] float float_Array_0[2][3] = { {9.25, 128.75, 255.675}, {4.5, 5.5, 32.8} }; [L25-L27] float float_Array_0[2][3] = { {9.25, 128.75, 255.675}, {4.5, 5.5, 32.8} }; [L25-L27] float float_Array_0[2][3] = { {9.25, 128.75, 255.675}, {4.5, 5.5, 32.8} }; [L25-L27] float float_Array_0[2][3] = { {9.25, 128.75, 255.675}, {4.5, 5.5, 32.8} }; [L25-L27] float float_Array_0[2][3] = { {9.25, 128.75, 255.675}, {4.5, 5.5, 32.8} }; [L25-L27] float float_Array_0[2][3] = { {9.25, 128.75, 255.675}, {4.5, 5.5, 32.8} }; [L25-L27] float float_Array_0[2][3] = { {9.25, 128.75, 255.675}, {4.5, 5.5, 32.8} }; [L28-L30] signed long int signed_long_int_Array_0[1] = { 64 }; [L28-L30] signed long int signed_long_int_Array_0[1] = { 64 }; [L31-L33] unsigned char unsigned_char_Array_0[3][3] = { {8, 5, 100}, {4, 200, 64}, {100, 200, 2} }; [L31-L33] unsigned char unsigned_char_Array_0[3][3] = { {8, 5, 100}, {4, 200, 64}, {100, 200, 2} }; [L31-L33] unsigned char unsigned_char_Array_0[3][3] = { {8, 5, 100}, {4, 200, 64}, {100, 200, 2} }; [L31-L33] unsigned char unsigned_char_Array_0[3][3] = { {8, 5, 100}, {4, 200, 64}, {100, 200, 2} }; [L31-L33] unsigned char unsigned_char_Array_0[3][3] = { {8, 5, 100}, {4, 200, 64}, {100, 200, 2} }; [L31-L33] unsigned char unsigned_char_Array_0[3][3] = { {8, 5, 100}, {4, 200, 64}, {100, 200, 2} }; [L31-L33] unsigned char unsigned_char_Array_0[3][3] = { {8, 5, 100}, {4, 200, 64}, {100, 200, 2} }; [L31-L33] unsigned char unsigned_char_Array_0[3][3] = { {8, 5, 100}, {4, 200, 64}, {100, 200, 2} }; [L31-L33] unsigned char unsigned_char_Array_0[3][3] = { {8, 5, 100}, {4, 200, 64}, {100, 200, 2} }; [L31-L33] unsigned char unsigned_char_Array_0[3][3] = { {8, 5, 100}, {4, 200, 64}, {100, 200, 2} }; [L34-L36] unsigned long int unsigned_long_int_Array_0[1] = { 1 }; [L34-L36] unsigned long int unsigned_long_int_Array_0[1] = { 1 }; [L37] unsigned char last_1_unsigned_char_Array_0_0__1_ = 5; VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=0, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L111] isInitial = 1 [L112] FCALL initially() [L113] COND TRUE 1 [L114] CALL updateLastVariables() [L104] EXPR unsigned_char_Array_0[0][1] [L104] last_1_unsigned_char_Array_0_0__1_ = unsigned_char_Array_0[0][1] [L114] RET updateLastVariables() [L115] CALL updateVariables() [L68] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L69] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L69] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L69] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L70] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L70] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L70] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L71] float_Array_0[0][0] = __VERIFIER_nondet_float() [L72] EXPR float_Array_0[0][0] [L72] EXPR float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L72] EXPR float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F [L72] EXPR float_Array_0[0][0] [L72] EXPR float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L72] EXPR (float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854765600e+12F && float_Array_0[0][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L72] EXPR (float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854765600e+12F && float_Array_0[0][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L72] CALL assume_abort_if_not((float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854765600e+12F && float_Array_0[0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L72] RET assume_abort_if_not((float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854765600e+12F && float_Array_0[0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L73] float_Array_0[1][0] = __VERIFIER_nondet_float() [L74] EXPR float_Array_0[1][0] [L74] EXPR float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L74] EXPR float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F [L74] EXPR float_Array_0[1][0] [L74] EXPR float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L74] EXPR (float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854776000e+12F && float_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L74] EXPR (float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854776000e+12F && float_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L74] CALL assume_abort_if_not((float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854776000e+12F && float_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L74] RET assume_abort_if_not((float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854776000e+12F && float_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L75] float_Array_0[0][1] = __VERIFIER_nondet_float() [L76] EXPR float_Array_0[0][1] [L76] EXPR float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F [L76] EXPR float_Array_0[0][1] [L76] EXPR float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR (float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854776000e+12F && float_Array_0[0][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR (float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854776000e+12F && float_Array_0[0][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] CALL assume_abort_if_not((float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854776000e+12F && float_Array_0[0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] RET assume_abort_if_not((float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854776000e+12F && float_Array_0[0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L77] float_Array_0[1][1] = __VERIFIER_nondet_float() [L78] EXPR float_Array_0[1][1] [L78] EXPR float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] EXPR float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F [L78] EXPR float_Array_0[1][1] [L78] EXPR float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] EXPR (float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 9223372.036854776000e+12F && float_Array_0[1][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] EXPR (float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 9223372.036854776000e+12F && float_Array_0[1][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] CALL assume_abort_if_not((float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 9223372.036854776000e+12F && float_Array_0[1][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] RET assume_abort_if_not((float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 9223372.036854776000e+12F && float_Array_0[1][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L79] float_Array_0[0][2] = __VERIFIER_nondet_float() [L80] EXPR float_Array_0[0][2] [L80] EXPR float_Array_0[0][2] >= -922337.2036854776000e+13F && float_Array_0[0][2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] EXPR float_Array_0[0][2] >= -922337.2036854776000e+13F && float_Array_0[0][2] <= -1.0e-20F [L80] EXPR float_Array_0[0][2] [L80] EXPR float_Array_0[0][2] >= -922337.2036854776000e+13F && float_Array_0[0][2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] EXPR (float_Array_0[0][2] >= -922337.2036854776000e+13F && float_Array_0[0][2] <= -1.0e-20F) || (float_Array_0[0][2] <= 9223372.036854776000e+12F && float_Array_0[0][2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] EXPR (float_Array_0[0][2] >= -922337.2036854776000e+13F && float_Array_0[0][2] <= -1.0e-20F) || (float_Array_0[0][2] <= 9223372.036854776000e+12F && float_Array_0[0][2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] CALL assume_abort_if_not((float_Array_0[0][2] >= -922337.2036854776000e+13F && float_Array_0[0][2] <= -1.0e-20F) || (float_Array_0[0][2] <= 9223372.036854776000e+12F && float_Array_0[0][2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] RET assume_abort_if_not((float_Array_0[0][2] >= -922337.2036854776000e+13F && float_Array_0[0][2] <= -1.0e-20F) || (float_Array_0[0][2] <= 9223372.036854776000e+12F && float_Array_0[0][2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L81] unsigned_char_Array_0[0][0] = __VERIFIER_nondet_uchar() [L82] EXPR unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L82] CALL assume_abort_if_not(unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L82] RET assume_abort_if_not(unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L83] EXPR unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L83] CALL assume_abort_if_not(unsigned_char_Array_0[0][0] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L83] RET assume_abort_if_not(unsigned_char_Array_0[0][0] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L84] unsigned_char_Array_0[1][0] = __VERIFIER_nondet_uchar() [L85] EXPR unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L85] CALL assume_abort_if_not(unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L85] RET assume_abort_if_not(unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L86] EXPR unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L86] CALL assume_abort_if_not(unsigned_char_Array_0[1][0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L86] RET assume_abort_if_not(unsigned_char_Array_0[1][0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L87] unsigned_char_Array_0[1][1] = __VERIFIER_nondet_uchar() [L88] EXPR unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L88] CALL assume_abort_if_not(unsigned_char_Array_0[1][1] >= 190) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L88] RET assume_abort_if_not(unsigned_char_Array_0[1][1] >= 190) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L89] EXPR unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L89] CALL assume_abort_if_not(unsigned_char_Array_0[1][1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L89] RET assume_abort_if_not(unsigned_char_Array_0[1][1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L90] unsigned_char_Array_0[2][1] = __VERIFIER_nondet_uchar() [L91] EXPR unsigned_char_Array_0[2][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L91] CALL assume_abort_if_not(unsigned_char_Array_0[2][1] >= 191) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L91] RET assume_abort_if_not(unsigned_char_Array_0[2][1] >= 191) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L92] EXPR unsigned_char_Array_0[2][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L92] CALL assume_abort_if_not(unsigned_char_Array_0[2][1] <= 255) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L92] RET assume_abort_if_not(unsigned_char_Array_0[2][1] <= 255) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L93] unsigned_char_Array_0[0][2] = __VERIFIER_nondet_uchar() [L94] EXPR unsigned_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] CALL assume_abort_if_not(unsigned_char_Array_0[0][2] >= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] RET assume_abort_if_not(unsigned_char_Array_0[0][2] >= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L95] EXPR unsigned_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L95] CALL assume_abort_if_not(unsigned_char_Array_0[0][2] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L95] RET assume_abort_if_not(unsigned_char_Array_0[0][2] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L96] unsigned_char_Array_0[1][2] = __VERIFIER_nondet_uchar() [L97] EXPR unsigned_char_Array_0[1][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L97] CALL assume_abort_if_not(unsigned_char_Array_0[1][2] >= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L97] RET assume_abort_if_not(unsigned_char_Array_0[1][2] >= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L98] EXPR unsigned_char_Array_0[1][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L98] CALL assume_abort_if_not(unsigned_char_Array_0[1][2] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L98] RET assume_abort_if_not(unsigned_char_Array_0[1][2] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L99] unsigned_char_Array_0[2][2] = __VERIFIER_nondet_uchar() [L100] EXPR unsigned_char_Array_0[2][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L100] CALL assume_abort_if_not(unsigned_char_Array_0[2][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L100] RET assume_abort_if_not(unsigned_char_Array_0[2][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L101] EXPR unsigned_char_Array_0[2][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L101] CALL assume_abort_if_not(unsigned_char_Array_0[2][2] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L101] RET assume_abort_if_not(unsigned_char_Array_0[2][2] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L115] RET updateVariables() [L116] CALL step() [L41] EXPR float_Array_0[0][2] [L41] EXPR float_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L41] COND FALSE !(float_Array_0[0][2] <= float_Array_0[1][1]) [L48] EXPR float_Array_0[0][0] [L48] float_Array_0[1][2] = float_Array_0[0][0] [L50] EXPR unsigned_char_Array_0[0][2] [L50] unsigned_long_int_Array_0[0] = unsigned_char_Array_0[0][2] [L51] EXPR unsigned_char_Array_0[2][1] [L51] signed_long_int_Array_0[0] = unsigned_char_Array_0[2][1] [L52] unsigned_char_Array_0[2][0] = 4 [L53] EXPR signed_long_int_Array_0[0] [L53] signed long int stepLocal_0 = signed_long_int_Array_0[0]; [L54] EXPR unsigned_char_Array_0[2][1] [L54] EXPR unsigned_char_Array_0[0][0] [L54] EXPR unsigned_char_Array_0[2][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L54] COND FALSE !(((unsigned_char_Array_0[2][1] - unsigned_char_Array_0[0][0]) - (8 + unsigned_char_Array_0[2][2])) > stepLocal_0) [L57] EXPR BOOL_unsigned_char_Array_0[1] [L57] BOOL_unsigned_char_Array_0[0] = BOOL_unsigned_char_Array_0[1] [L59] BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L59] COND FALSE !(BOOL_unsigned_char_Array_0[0]) [L116] RET step() [L117] CALL, EXPR property() [L107] EXPR float_Array_0[0][2] [L107] EXPR float_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L107] EXPR (float_Array_0[0][2] <= float_Array_0[1][1]) ? ((float_Array_0[1][1] < ((float_Array_0[0][1] - float_Array_0[1][0]) + 1.395f)) ? (float_Array_0[1][2] == ((float) float_Array_0[0][0])) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) : (float_Array_0[1][2] == ((float) float_Array_0[0][0])) [L107] EXPR float_Array_0[1][2] [L107] EXPR float_Array_0[0][0] [L107] EXPR (float_Array_0[0][2] <= float_Array_0[1][1]) ? ((float_Array_0[1][1] < ((float_Array_0[0][1] - float_Array_0[1][0]) + 1.395f)) ? (float_Array_0[1][2] == ((float) float_Array_0[0][0])) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) : (float_Array_0[1][2] == ((float) float_Array_0[0][0])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L107] EXPR ((float_Array_0[0][2] <= float_Array_0[1][1]) ? ((float_Array_0[1][1] < ((float_Array_0[0][1] - float_Array_0[1][0]) + 1.395f)) ? (float_Array_0[1][2] == ((float) float_Array_0[0][0])) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) && (BOOL_unsigned_char_Array_0[0] ? ((last_1_unsigned_char_Array_0_0__1_ != last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[0][1] == ((unsigned char) ((unsigned_char_Array_0[1][1] - unsigned_char_Array_0[0][0]) - unsigned_char_Array_0[1][0]))) : (unsigned_char_Array_0[0][1] == ((unsigned char) (unsigned_char_Array_0[1][1] - (((((unsigned_char_Array_0[0][2]) > (unsigned_char_Array_0[1][2])) ? (unsigned_char_Array_0[0][2]) : (unsigned_char_Array_0[1][2]))) - unsigned_char_Array_0[0][0]))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L107] EXPR ((float_Array_0[0][2] <= float_Array_0[1][1]) ? ((float_Array_0[1][1] < ((float_Array_0[0][1] - float_Array_0[1][0]) + 1.395f)) ? (float_Array_0[1][2] == ((float) float_Array_0[0][0])) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) && (BOOL_unsigned_char_Array_0[0] ? ((last_1_unsigned_char_Array_0_0__1_ != last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[0][1] == ((unsigned char) ((unsigned_char_Array_0[1][1] - unsigned_char_Array_0[0][0]) - unsigned_char_Array_0[1][0]))) : (unsigned_char_Array_0[0][1] == ((unsigned char) (unsigned_char_Array_0[1][1] - (((((unsigned_char_Array_0[0][2]) > (unsigned_char_Array_0[1][2])) ? (unsigned_char_Array_0[0][2]) : (unsigned_char_Array_0[1][2]))) - unsigned_char_Array_0[0][0]))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L107] EXPR (((float_Array_0[0][2] <= float_Array_0[1][1]) ? ((float_Array_0[1][1] < ((float_Array_0[0][1] - float_Array_0[1][0]) + 1.395f)) ? (float_Array_0[1][2] == ((float) float_Array_0[0][0])) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) && (BOOL_unsigned_char_Array_0[0] ? ((last_1_unsigned_char_Array_0_0__1_ != last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[0][1] == ((unsigned char) ((unsigned_char_Array_0[1][1] - unsigned_char_Array_0[0][0]) - unsigned_char_Array_0[1][0]))) : (unsigned_char_Array_0[0][1] == ((unsigned char) (unsigned_char_Array_0[1][1] - (((((unsigned_char_Array_0[0][2]) > (unsigned_char_Array_0[1][2])) ? (unsigned_char_Array_0[0][2]) : (unsigned_char_Array_0[1][2]))) - unsigned_char_Array_0[0][0]))))) : 1)) && ((((unsigned_char_Array_0[2][1] - unsigned_char_Array_0[0][0]) - (8 + unsigned_char_Array_0[2][2])) > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L107] EXPR (((float_Array_0[0][2] <= float_Array_0[1][1]) ? ((float_Array_0[1][1] < ((float_Array_0[0][1] - float_Array_0[1][0]) + 1.395f)) ? (float_Array_0[1][2] == ((float) float_Array_0[0][0])) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) && (BOOL_unsigned_char_Array_0[0] ? ((last_1_unsigned_char_Array_0_0__1_ != last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[0][1] == ((unsigned char) ((unsigned_char_Array_0[1][1] - unsigned_char_Array_0[0][0]) - unsigned_char_Array_0[1][0]))) : (unsigned_char_Array_0[0][1] == ((unsigned char) (unsigned_char_Array_0[1][1] - (((((unsigned_char_Array_0[0][2]) > (unsigned_char_Array_0[1][2])) ? (unsigned_char_Array_0[0][2]) : (unsigned_char_Array_0[1][2]))) - unsigned_char_Array_0[0][0]))))) : 1)) && ((((unsigned_char_Array_0[2][1] - unsigned_char_Array_0[0][0]) - (8 + unsigned_char_Array_0[2][2])) > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L107] EXPR ((((float_Array_0[0][2] <= float_Array_0[1][1]) ? ((float_Array_0[1][1] < ((float_Array_0[0][1] - float_Array_0[1][0]) + 1.395f)) ? (float_Array_0[1][2] == ((float) float_Array_0[0][0])) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) && (BOOL_unsigned_char_Array_0[0] ? ((last_1_unsigned_char_Array_0_0__1_ != last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[0][1] == ((unsigned char) ((unsigned_char_Array_0[1][1] - unsigned_char_Array_0[0][0]) - unsigned_char_Array_0[1][0]))) : (unsigned_char_Array_0[0][1] == ((unsigned char) (unsigned_char_Array_0[1][1] - (((((unsigned_char_Array_0[0][2]) > (unsigned_char_Array_0[1][2])) ? (unsigned_char_Array_0[0][2]) : (unsigned_char_Array_0[1][2]))) - unsigned_char_Array_0[0][0]))))) : 1)) && ((((unsigned_char_Array_0[2][1] - unsigned_char_Array_0[0][0]) - (8 + unsigned_char_Array_0[2][2])) > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[0][2])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L107] EXPR ((((float_Array_0[0][2] <= float_Array_0[1][1]) ? ((float_Array_0[1][1] < ((float_Array_0[0][1] - float_Array_0[1][0]) + 1.395f)) ? (float_Array_0[1][2] == ((float) float_Array_0[0][0])) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) && (BOOL_unsigned_char_Array_0[0] ? ((last_1_unsigned_char_Array_0_0__1_ != last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[0][1] == ((unsigned char) ((unsigned_char_Array_0[1][1] - unsigned_char_Array_0[0][0]) - unsigned_char_Array_0[1][0]))) : (unsigned_char_Array_0[0][1] == ((unsigned char) (unsigned_char_Array_0[1][1] - (((((unsigned_char_Array_0[0][2]) > (unsigned_char_Array_0[1][2])) ? (unsigned_char_Array_0[0][2]) : (unsigned_char_Array_0[1][2]))) - unsigned_char_Array_0[0][0]))))) : 1)) && ((((unsigned_char_Array_0[2][1] - unsigned_char_Array_0[0][0]) - (8 + unsigned_char_Array_0[2][2])) > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[0][2])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L107] EXPR (((((float_Array_0[0][2] <= float_Array_0[1][1]) ? ((float_Array_0[1][1] < ((float_Array_0[0][1] - float_Array_0[1][0]) + 1.395f)) ? (float_Array_0[1][2] == ((float) float_Array_0[0][0])) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) && (BOOL_unsigned_char_Array_0[0] ? ((last_1_unsigned_char_Array_0_0__1_ != last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[0][1] == ((unsigned char) ((unsigned_char_Array_0[1][1] - unsigned_char_Array_0[0][0]) - unsigned_char_Array_0[1][0]))) : (unsigned_char_Array_0[0][1] == ((unsigned char) (unsigned_char_Array_0[1][1] - (((((unsigned_char_Array_0[0][2]) > (unsigned_char_Array_0[1][2])) ? (unsigned_char_Array_0[0][2]) : (unsigned_char_Array_0[1][2]))) - unsigned_char_Array_0[0][0]))))) : 1)) && ((((unsigned_char_Array_0[2][1] - unsigned_char_Array_0[0][0]) - (8 + unsigned_char_Array_0[2][2])) > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[0][2]))) && (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[2][1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L107] EXPR (((((float_Array_0[0][2] <= float_Array_0[1][1]) ? ((float_Array_0[1][1] < ((float_Array_0[0][1] - float_Array_0[1][0]) + 1.395f)) ? (float_Array_0[1][2] == ((float) float_Array_0[0][0])) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) && (BOOL_unsigned_char_Array_0[0] ? ((last_1_unsigned_char_Array_0_0__1_ != last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[0][1] == ((unsigned char) ((unsigned_char_Array_0[1][1] - unsigned_char_Array_0[0][0]) - unsigned_char_Array_0[1][0]))) : (unsigned_char_Array_0[0][1] == ((unsigned char) (unsigned_char_Array_0[1][1] - (((((unsigned_char_Array_0[0][2]) > (unsigned_char_Array_0[1][2])) ? (unsigned_char_Array_0[0][2]) : (unsigned_char_Array_0[1][2]))) - unsigned_char_Array_0[0][0]))))) : 1)) && ((((unsigned_char_Array_0[2][1] - unsigned_char_Array_0[0][0]) - (8 + unsigned_char_Array_0[2][2])) > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[0][2]))) && (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[2][1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L107] EXPR ((((((float_Array_0[0][2] <= float_Array_0[1][1]) ? ((float_Array_0[1][1] < ((float_Array_0[0][1] - float_Array_0[1][0]) + 1.395f)) ? (float_Array_0[1][2] == ((float) float_Array_0[0][0])) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) && (BOOL_unsigned_char_Array_0[0] ? ((last_1_unsigned_char_Array_0_0__1_ != last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[0][1] == ((unsigned char) ((unsigned_char_Array_0[1][1] - unsigned_char_Array_0[0][0]) - unsigned_char_Array_0[1][0]))) : (unsigned_char_Array_0[0][1] == ((unsigned char) (unsigned_char_Array_0[1][1] - (((((unsigned_char_Array_0[0][2]) > (unsigned_char_Array_0[1][2])) ? (unsigned_char_Array_0[0][2]) : (unsigned_char_Array_0[1][2]))) - unsigned_char_Array_0[0][0]))))) : 1)) && ((((unsigned_char_Array_0[2][1] - unsigned_char_Array_0[0][0]) - (8 + unsigned_char_Array_0[2][2])) > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[0][2]))) && (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[2][1]))) && (unsigned_char_Array_0[2][0] == ((unsigned char) 4)) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L107] EXPR ((((((float_Array_0[0][2] <= float_Array_0[1][1]) ? ((float_Array_0[1][1] < ((float_Array_0[0][1] - float_Array_0[1][0]) + 1.395f)) ? (float_Array_0[1][2] == ((float) float_Array_0[0][0])) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) && (BOOL_unsigned_char_Array_0[0] ? ((last_1_unsigned_char_Array_0_0__1_ != last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[0][1] == ((unsigned char) ((unsigned_char_Array_0[1][1] - unsigned_char_Array_0[0][0]) - unsigned_char_Array_0[1][0]))) : (unsigned_char_Array_0[0][1] == ((unsigned char) (unsigned_char_Array_0[1][1] - (((((unsigned_char_Array_0[0][2]) > (unsigned_char_Array_0[1][2])) ? (unsigned_char_Array_0[0][2]) : (unsigned_char_Array_0[1][2]))) - unsigned_char_Array_0[0][0]))))) : 1)) && ((((unsigned_char_Array_0[2][1] - unsigned_char_Array_0[0][0]) - (8 + unsigned_char_Array_0[2][2])) > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[0][2]))) && (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[2][1]))) && (unsigned_char_Array_0[2][0] == ((unsigned char) 4)) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L107-L108] return ((((((float_Array_0[0][2] <= float_Array_0[1][1]) ? ((float_Array_0[1][1] < ((float_Array_0[0][1] - float_Array_0[1][0]) + 1.395f)) ? (float_Array_0[1][2] == ((float) float_Array_0[0][0])) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) && (BOOL_unsigned_char_Array_0[0] ? ((last_1_unsigned_char_Array_0_0__1_ != last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[0][1] == ((unsigned char) ((unsigned_char_Array_0[1][1] - unsigned_char_Array_0[0][0]) - unsigned_char_Array_0[1][0]))) : (unsigned_char_Array_0[0][1] == ((unsigned char) (unsigned_char_Array_0[1][1] - (((((unsigned_char_Array_0[0][2]) > (unsigned_char_Array_0[1][2])) ? (unsigned_char_Array_0[0][2]) : (unsigned_char_Array_0[1][2]))) - unsigned_char_Array_0[0][0]))))) : 1)) && ((((unsigned_char_Array_0[2][1] - unsigned_char_Array_0[0][0]) - (8 + unsigned_char_Array_0[2][2])) > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[0][2]))) && (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[2][1]))) && (unsigned_char_Array_0[2][0] == ((unsigned char) 4)) ; [L117] RET, EXPR property() [L117] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 118 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.0s, OverallIterations: 7, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3 mSDsluCounter, 2750 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1781 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 183 IncrementalHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 969 mSDtfsCounter, 183 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 201 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122occurred in iteration=5, InterpolantAutomatonStates: 24, 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, 6 MinimizatonAttempts, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1344 NumberOfCodeBlocks, 1344 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1169 ConstructedInterpolants, 0 QuantifiedInterpolants, 1210 SizeOfPredicates, 0 NumberOfNonLiveVariables, 572 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 7 InterpolantComputations, 6 PerfectInterpolantSequences, 5840/5880 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-19 00:35:57,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-48.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 b209b13322483f0de6355983dfc45de7dda6e23f708a5a679f61eb11dccb6a42 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:35:59,588 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:35:59,640 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-19 00:35:59,644 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:35:59,644 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:35:59,665 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:35:59,667 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:35:59,667 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:35:59,668 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:35:59,668 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:35:59,668 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:35:59,669 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:35:59,669 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:35:59,669 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:35:59,671 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:35:59,671 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:35:59,671 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:35:59,672 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:35:59,672 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:35:59,672 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:35:59,672 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:35:59,674 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:35:59,675 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:35:59,675 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 00:35:59,675 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 00:35:59,675 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:35:59,675 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 00:35:59,675 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:35:59,676 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:35:59,676 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:35:59,676 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:35:59,677 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:35:59,677 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:35:59,677 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:35:59,677 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:35:59,678 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:35:59,678 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:35:59,678 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:35:59,678 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 00:35:59,678 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 00:35:59,678 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:35:59,679 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:35:59,679 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:35:59,679 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:35:59,679 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 -> b209b13322483f0de6355983dfc45de7dda6e23f708a5a679f61eb11dccb6a42 [2024-11-19 00:35:59,923 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:35:59,943 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:35:59,946 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:35:59,947 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:35:59,947 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:35:59,948 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-48.i [2024-11-19 00:36:01,211 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:36:01,435 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:36:01,436 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-48.i [2024-11-19 00:36:01,444 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15330760e/08f4b478b7b743cd9e00f5051a13f234/FLAGd9624579c [2024-11-19 00:36:01,792 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15330760e/08f4b478b7b743cd9e00f5051a13f234 [2024-11-19 00:36:01,794 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:36:01,795 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:36:01,796 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:36:01,796 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:36:01,801 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:36:01,801 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:36:01" (1/1) ... [2024-11-19 00:36:01,802 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28ec53c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:36:01, skipping insertion in model container [2024-11-19 00:36:01,803 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:36:01" (1/1) ... [2024-11-19 00:36:01,825 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:36:01,970 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-48.i[916,929] [2024-11-19 00:36:02,040 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:36:02,056 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:36:02,066 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-48.i[916,929] [2024-11-19 00:36:02,125 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:36:02,148 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:36:02,148 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:36:02 WrapperNode [2024-11-19 00:36:02,148 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:36:02,149 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:36:02,149 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:36:02,150 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:36:02,156 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:36:02" (1/1) ... [2024-11-19 00:36:02,188 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:36:02" (1/1) ... [2024-11-19 00:36:02,228 INFO L138 Inliner]: procedures = 33, calls = 180, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 503 [2024-11-19 00:36:02,229 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:36:02,229 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:36:02,230 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:36:02,230 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:36:02,238 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:36:02" (1/1) ... [2024-11-19 00:36:02,238 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:36:02" (1/1) ... [2024-11-19 00:36:02,248 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:36:02" (1/1) ... [2024-11-19 00:36:02,279 INFO L175 MemorySlicer]: Split 143 memory accesses to 6 slices as follows [2, 15, 53, 5, 65, 3]. 45 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [2, 2, 6, 1, 9, 1]. The 23 writes are split as follows [0, 3, 8, 1, 10, 1]. [2024-11-19 00:36:02,281 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:36:02" (1/1) ... [2024-11-19 00:36:02,281 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:36:02" (1/1) ... [2024-11-19 00:36:02,301 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:36:02" (1/1) ... [2024-11-19 00:36:02,308 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:36:02" (1/1) ... [2024-11-19 00:36:02,311 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:36:02" (1/1) ... [2024-11-19 00:36:02,313 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:36:02" (1/1) ... [2024-11-19 00:36:02,317 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:36:02,318 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:36:02,318 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:36:02,318 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:36:02,320 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:36:02" (1/1) ... [2024-11-19 00:36:02,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:36:02,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:36:02,344 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-19 00:36:02,349 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-19 00:36:02,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:36:02,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-19 00:36:02,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-19 00:36:02,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-19 00:36:02,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-19 00:36:02,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-19 00:36:02,377 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-19 00:36:02,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 00:36:02,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 00:36:02,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-19 00:36:02,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-19 00:36:02,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-19 00:36:02,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-19 00:36:02,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-19 00:36:02,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-19 00:36:02,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-19 00:36:02,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-19 00:36:02,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-19 00:36:02,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-19 00:36:02,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-19 00:36:02,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-19 00:36:02,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-19 00:36:02,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-19 00:36:02,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-19 00:36:02,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-19 00:36:02,379 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 00:36:02,379 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 00:36:02,379 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-19 00:36:02,379 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-19 00:36:02,379 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-19 00:36:02,379 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-19 00:36:02,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-19 00:36:02,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-19 00:36:02,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-19 00:36:02,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-19 00:36:02,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-19 00:36:02,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-19 00:36:02,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-19 00:36:02,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-19 00:36:02,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-19 00:36:02,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-19 00:36:02,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-19 00:36:02,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-11-19 00:36:02,381 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:36:02,381 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:36:02,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:36:02,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:36:02,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-19 00:36:02,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-19 00:36:02,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-19 00:36:02,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-19 00:36:02,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-19 00:36:02,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-19 00:36:02,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-19 00:36:02,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-19 00:36:02,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-19 00:36:02,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-19 00:36:02,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-19 00:36:02,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-19 00:36:02,506 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:36:02,507 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:36:03,557 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2024-11-19 00:36:03,557 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:36:03,572 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:36:03,573 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:36:03,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:36:03 BoogieIcfgContainer [2024-11-19 00:36:03,573 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:36:03,575 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:36:03,575 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:36:03,578 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:36:03,578 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:36:01" (1/3) ... [2024-11-19 00:36:03,578 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b9bca92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:36:03, skipping insertion in model container [2024-11-19 00:36:03,578 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:36:02" (2/3) ... [2024-11-19 00:36:03,578 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b9bca92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:36:03, skipping insertion in model container [2024-11-19 00:36:03,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:36:03" (3/3) ... [2024-11-19 00:36:03,580 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-48.i [2024-11-19 00:36:03,591 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:36:03,591 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:36:03,641 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:36:03,645 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;@497dc73, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:36:03,646 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:36:03,649 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 94 states have (on average 1.3936170212765957) internal successors, (131), 95 states have internal predecessors, (131), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-19 00:36:03,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-19 00:36:03,659 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:36:03,659 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:36:03,660 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:36:03,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:36:03,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1009184855, now seen corresponding path program 1 times [2024-11-19 00:36:03,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:36:03,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1372564844] [2024-11-19 00:36:03,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:36:03,674 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-19 00:36:03,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:36:03,675 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-19 00:36:03,676 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-19 00:36:03,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:36:04,000 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:36:04,009 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:36:04,044 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 424 proven. 0 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2024-11-19 00:36:04,044 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:36:04,044 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:36:04,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1372564844] [2024-11-19 00:36:04,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1372564844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:36:04,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:36:04,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 00:36:04,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229839872] [2024-11-19 00:36:04,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:36:04,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:36:04,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:36:04,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:36:04,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:36:04,074 INFO L87 Difference]: Start difference. First operand has 118 states, 94 states have (on average 1.3936170212765957) internal successors, (131), 95 states have internal predecessors, (131), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-19 00:36:04,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:36:04,102 INFO L93 Difference]: Finished difference Result 229 states and 361 transitions. [2024-11-19 00:36:04,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:36:04,104 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 168 [2024-11-19 00:36:04,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:36:04,109 INFO L225 Difference]: With dead ends: 229 [2024-11-19 00:36:04,109 INFO L226 Difference]: Without dead ends: 114 [2024-11-19 00:36:04,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 167 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-19 00:36:04,114 INFO L432 NwaCegarLoop]: 164 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, 164 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-19 00:36:04,114 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:36:04,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-19 00:36:04,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-11-19 00:36:04,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 91 states have (on average 1.3406593406593406) internal successors, (122), 91 states have internal predecessors, (122), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-19 00:36:04,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 164 transitions. [2024-11-19 00:36:04,143 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 164 transitions. Word has length 168 [2024-11-19 00:36:04,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:36:04,143 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 164 transitions. [2024-11-19 00:36:04,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-19 00:36:04,144 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 164 transitions. [2024-11-19 00:36:04,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-19 00:36:04,146 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:36:04,146 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:36:04,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-19 00:36:04,346 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-19 00:36:04,347 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:36:04,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:36:04,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1949683919, now seen corresponding path program 1 times [2024-11-19 00:36:04,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:36:04,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1665712045] [2024-11-19 00:36:04,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:36:04,349 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-19 00:36:04,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:36:04,350 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-19 00:36:04,351 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-19 00:36:04,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:36:04,635 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 00:36:04,640 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:36:04,699 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2024-11-19 00:36:04,699 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:36:04,699 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:36:04,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1665712045] [2024-11-19 00:36:04,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1665712045] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:36:04,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:36:04,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:36:04,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811061832] [2024-11-19 00:36:04,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:36:04,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:36:04,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:36:04,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:36:04,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:36:04,702 INFO L87 Difference]: Start difference. First operand 114 states and 164 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-19 00:36:04,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:36:04,747 INFO L93 Difference]: Finished difference Result 227 states and 328 transitions. [2024-11-19 00:36:04,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:36:04,747 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 168 [2024-11-19 00:36:04,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:36:04,749 INFO L225 Difference]: With dead ends: 227 [2024-11-19 00:36:04,749 INFO L226 Difference]: Without dead ends: 116 [2024-11-19 00:36:04,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 165 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-19 00:36:04,750 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 0 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:36:04,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 475 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:36:04,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-19 00:36:04,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-19 00:36:04,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 93 states have (on average 1.3333333333333333) internal successors, (124), 93 states have internal predecessors, (124), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-19 00:36:04,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 166 transitions. [2024-11-19 00:36:04,761 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 166 transitions. Word has length 168 [2024-11-19 00:36:04,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:36:04,762 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 166 transitions. [2024-11-19 00:36:04,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-19 00:36:04,762 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 166 transitions. [2024-11-19 00:36:04,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-19 00:36:04,764 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:36:04,764 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:36:04,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-19 00:36:04,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:36:04,965 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:36:04,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:36:04,966 INFO L85 PathProgramCache]: Analyzing trace with hash 503103053, now seen corresponding path program 1 times [2024-11-19 00:36:04,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:36:04,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2007174066] [2024-11-19 00:36:04,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:36:04,967 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-19 00:36:04,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:36:04,968 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-19 00:36:04,969 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-19 00:36:05,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:36:05,243 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 00:36:05,248 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:36:05,587 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 66 treesize of output 48 [2024-11-19 00:36:05,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 00:36:05,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 62 [2024-11-19 00:36:05,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 4 [2024-11-19 00:36:05,684 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:36:05,685 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 27 treesize of output 13 [2024-11-19 00:36:05,705 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 98 proven. 57 refuted. 0 times theorem prover too weak. 685 trivial. 0 not checked. [2024-11-19 00:36:05,706 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:36:06,084 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 3 proven. 57 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-19 00:36:06,086 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:36:06,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2007174066] [2024-11-19 00:36:06,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2007174066] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 00:36:06,086 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 00:36:06,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2024-11-19 00:36:06,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354837852] [2024-11-19 00:36:06,087 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 00:36:06,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 00:36:06,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:36:06,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 00:36:06,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-11-19 00:36:06,091 INFO L87 Difference]: Start difference. First operand 116 states and 166 transitions. Second operand has 13 states, 11 states have (on average 7.181818181818182) internal successors, (79), 13 states have internal predecessors, (79), 4 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (41), 2 states have call predecessors, (41), 4 states have call successors, (41) [2024-11-19 00:36:06,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:36:06,776 INFO L93 Difference]: Finished difference Result 358 states and 506 transitions. [2024-11-19 00:36:06,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-19 00:36:06,777 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 7.181818181818182) internal successors, (79), 13 states have internal predecessors, (79), 4 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (41), 2 states have call predecessors, (41), 4 states have call successors, (41) Word has length 168 [2024-11-19 00:36:06,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:36:06,779 INFO L225 Difference]: With dead ends: 358 [2024-11-19 00:36:06,779 INFO L226 Difference]: Without dead ends: 245 [2024-11-19 00:36:06,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 323 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=584, Unknown=0, NotChecked=0, Total=756 [2024-11-19 00:36:06,781 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 233 mSDsluCounter, 991 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:36:06,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 1160 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 00:36:06,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-11-19 00:36:06,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 122. [2024-11-19 00:36:06,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 98 states have (on average 1.316326530612245) internal successors, (129), 98 states have internal predecessors, (129), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-19 00:36:06,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 171 transitions. [2024-11-19 00:36:06,806 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 171 transitions. Word has length 168 [2024-11-19 00:36:06,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:36:06,806 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 171 transitions. [2024-11-19 00:36:06,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 7.181818181818182) internal successors, (79), 13 states have internal predecessors, (79), 4 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (41), 2 states have call predecessors, (41), 4 states have call successors, (41) [2024-11-19 00:36:06,807 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 171 transitions. [2024-11-19 00:36:06,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-19 00:36:06,812 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:36:06,812 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:36:06,829 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-19 00:36:07,013 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-19 00:36:07,013 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:36:07,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:36:07,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1185840689, now seen corresponding path program 1 times [2024-11-19 00:36:07,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:36:07,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [540069114] [2024-11-19 00:36:07,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:36:07,014 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-19 00:36:07,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:36:07,017 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-19 00:36:07,018 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-19 00:36:07,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:36:07,260 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 00:36:07,263 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:36:07,286 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-19 00:36:07,286 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:36:07,286 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:36:07,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [540069114] [2024-11-19 00:36:07,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [540069114] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:36:07,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:36:07,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:36:07,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417396916] [2024-11-19 00:36:07,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:36:07,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:36:07,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:36:07,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:36:07,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:36:07,288 INFO L87 Difference]: Start difference. First operand 122 states and 171 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-19 00:36:07,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:36:07,325 INFO L93 Difference]: Finished difference Result 246 states and 346 transitions. [2024-11-19 00:36:07,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:36:07,327 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2024-11-19 00:36:07,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:36:07,328 INFO L225 Difference]: With dead ends: 246 [2024-11-19 00:36:07,328 INFO L226 Difference]: Without dead ends: 127 [2024-11-19 00:36:07,329 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 164 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-19 00:36:07,329 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 1 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:36:07,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 620 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:36:07,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-19 00:36:07,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2024-11-19 00:36:07,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 102 states have (on average 1.303921568627451) internal successors, (133), 102 states have internal predecessors, (133), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-19 00:36:07,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 175 transitions. [2024-11-19 00:36:07,340 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 175 transitions. Word has length 168 [2024-11-19 00:36:07,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:36:07,340 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 175 transitions. [2024-11-19 00:36:07,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-19 00:36:07,341 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 175 transitions. [2024-11-19 00:36:07,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-19 00:36:07,342 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:36:07,342 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:36:07,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-19 00:36:07,542 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-19 00:36:07,543 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:36:07,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:36:07,543 INFO L85 PathProgramCache]: Analyzing trace with hash -505782319, now seen corresponding path program 1 times [2024-11-19 00:36:07,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:36:07,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1114140888] [2024-11-19 00:36:07,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:36:07,544 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-19 00:36:07,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:36:07,545 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-19 00:36:07,546 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-19 00:36:07,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:36:07,791 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 00:36:07,794 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:36:07,824 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-19 00:36:07,825 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:36:07,825 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:36:07,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1114140888] [2024-11-19 00:36:07,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1114140888] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:36:07,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:36:07,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:36:07,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473877833] [2024-11-19 00:36:07,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:36:07,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:36:07,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:36:07,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:36:07,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:36:07,828 INFO L87 Difference]: Start difference. First operand 126 states and 175 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-19 00:36:07,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:36:07,873 INFO L93 Difference]: Finished difference Result 252 states and 351 transitions. [2024-11-19 00:36:07,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:36:07,874 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2024-11-19 00:36:07,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:36:07,876 INFO L225 Difference]: With dead ends: 252 [2024-11-19 00:36:07,876 INFO L226 Difference]: Without dead ends: 129 [2024-11-19 00:36:07,889 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:36:07,889 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 1 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:36:07,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 765 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:36:07,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-19 00:36:07,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2024-11-19 00:36:07,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 104 states have (on average 1.2980769230769231) internal successors, (135), 104 states have internal predecessors, (135), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-19 00:36:07,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 177 transitions. [2024-11-19 00:36:07,908 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 177 transitions. Word has length 168 [2024-11-19 00:36:07,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:36:07,908 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 177 transitions. [2024-11-19 00:36:07,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-19 00:36:07,909 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 177 transitions. [2024-11-19 00:36:07,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-19 00:36:07,910 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:36:07,910 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:36:07,919 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-19 00:36:08,110 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-19 00:36:08,112 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:36:08,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:36:08,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1269225043, now seen corresponding path program 1 times [2024-11-19 00:36:08,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:36:08,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1140394171] [2024-11-19 00:36:08,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:36:08,113 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-19 00:36:08,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:36:08,115 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-19 00:36:08,116 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-19 00:36:08,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:36:08,358 INFO L255 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 00:36:08,361 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:36:08,390 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-19 00:36:08,390 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:36:08,391 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:36:08,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1140394171] [2024-11-19 00:36:08,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1140394171] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:36:08,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:36:08,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 00:36:08,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827719796] [2024-11-19 00:36:08,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:36:08,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 00:36:08,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:36:08,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 00:36:08,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:36:08,393 INFO L87 Difference]: Start difference. First operand 128 states and 177 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-19 00:36:08,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:36:08,447 INFO L93 Difference]: Finished difference Result 256 states and 355 transitions. [2024-11-19 00:36:08,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:36:08,448 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2024-11-19 00:36:08,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:36:08,449 INFO L225 Difference]: With dead ends: 256 [2024-11-19 00:36:08,449 INFO L226 Difference]: Without dead ends: 131 [2024-11-19 00:36:08,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 162 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-19 00:36:08,450 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 1 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:36:08,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 911 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:36:08,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-19 00:36:08,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2024-11-19 00:36:08,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 106 states have (on average 1.2924528301886793) internal successors, (137), 106 states have internal predecessors, (137), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-19 00:36:08,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 179 transitions. [2024-11-19 00:36:08,458 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 179 transitions. Word has length 168 [2024-11-19 00:36:08,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:36:08,459 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 179 transitions. [2024-11-19 00:36:08,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-19 00:36:08,459 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 179 transitions. [2024-11-19 00:36:08,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-19 00:36:08,460 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:36:08,460 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:36:08,470 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-19 00:36:08,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:36:08,661 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:36:08,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:36:08,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1271072085, now seen corresponding path program 1 times [2024-11-19 00:36:08,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:36:08,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [583539252] [2024-11-19 00:36:08,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:36:08,662 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-19 00:36:08,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:36:08,666 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:36:08,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-19 00:36:08,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:36:08,894 INFO L255 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 00:36:08,898 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:36:08,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2024-11-19 00:36:08,991 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 624 trivial. 0 not checked. [2024-11-19 00:36:08,991 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:36:08,991 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:36:08,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [583539252] [2024-11-19 00:36:08,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [583539252] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:36:08,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:36:08,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:36:08,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950634061] [2024-11-19 00:36:08,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:36:08,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:36:08,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:36:08,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:36:08,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:36:08,994 INFO L87 Difference]: Start difference. First operand 130 states and 179 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-19 00:36:09,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:36:09,775 INFO L93 Difference]: Finished difference Result 258 states and 356 transitions. [2024-11-19 00:36:09,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:36:09,780 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 168 [2024-11-19 00:36:09,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:36:09,781 INFO L225 Difference]: With dead ends: 258 [2024-11-19 00:36:09,781 INFO L226 Difference]: Without dead ends: 131 [2024-11-19 00:36:09,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:36:09,782 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 144 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 00:36:09,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 496 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 00:36:09,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-19 00:36:09,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2024-11-19 00:36:09,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 106 states have (on average 1.2830188679245282) internal successors, (136), 106 states have internal predecessors, (136), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-19 00:36:09,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 178 transitions. [2024-11-19 00:36:09,792 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 178 transitions. Word has length 168 [2024-11-19 00:36:09,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:36:09,792 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 178 transitions. [2024-11-19 00:36:09,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-19 00:36:09,792 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 178 transitions. [2024-11-19 00:36:09,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-19 00:36:09,793 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:36:09,793 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:36:09,803 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 (8)] Forceful destruction successful, exit code 0 [2024-11-19 00:36:09,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:36:09,994 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:36:09,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:36:09,995 INFO L85 PathProgramCache]: Analyzing trace with hash 639609807, now seen corresponding path program 1 times [2024-11-19 00:36:09,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:36:09,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1732899857] [2024-11-19 00:36:09,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:36:09,995 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-19 00:36:09,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:36:09,996 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-19 00:36:09,997 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-19 00:36:10,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:36:10,244 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 00:36:10,248 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:36:10,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2024-11-19 00:36:10,346 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 568 trivial. 0 not checked. [2024-11-19 00:36:10,346 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:36:10,346 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:36:10,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1732899857] [2024-11-19 00:36:10,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1732899857] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:36:10,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:36:10,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:36:10,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777982372] [2024-11-19 00:36:10,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:36:10,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:36:10,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:36:10,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:36:10,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:36:10,348 INFO L87 Difference]: Start difference. First operand 130 states and 178 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-19 00:36:11,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:36:11,069 INFO L93 Difference]: Finished difference Result 258 states and 354 transitions. [2024-11-19 00:36:11,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:36:11,073 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 170 [2024-11-19 00:36:11,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:36:11,074 INFO L225 Difference]: With dead ends: 258 [2024-11-19 00:36:11,074 INFO L226 Difference]: Without dead ends: 131 [2024-11-19 00:36:11,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:36:11,075 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 135 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 00:36:11,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 494 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 00:36:11,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-19 00:36:11,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2024-11-19 00:36:11,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 106 states have (on average 1.2735849056603774) internal successors, (135), 106 states have internal predecessors, (135), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-19 00:36:11,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 177 transitions. [2024-11-19 00:36:11,088 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 177 transitions. Word has length 170 [2024-11-19 00:36:11,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:36:11,088 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 177 transitions. [2024-11-19 00:36:11,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-19 00:36:11,088 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 177 transitions. [2024-11-19 00:36:11,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-19 00:36:11,089 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:36:11,089 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:36:11,100 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-19 00:36:11,293 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-19 00:36:11,294 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:36:11,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:36:11,294 INFO L85 PathProgramCache]: Analyzing trace with hash -854207723, now seen corresponding path program 1 times [2024-11-19 00:36:11,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:36:11,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1667727144] [2024-11-19 00:36:11,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:36:11,295 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-19 00:36:11,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:36:11,297 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-19 00:36:11,298 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-19 00:36:11,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:36:11,694 INFO L255 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-19 00:36:11,699 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:36:11,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 00:36:11,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 32 [2024-11-19 00:36:11,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 32 [2024-11-19 00:36:11,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 32 [2024-11-19 00:36:12,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 32 [2024-11-19 00:36:12,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 65 [2024-11-19 00:36:12,509 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:36:12,510 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 194 treesize of output 80 [2024-11-19 00:36:12,553 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 152 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2024-11-19 00:36:12,553 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:36:12,669 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:36:12,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1667727144] [2024-11-19 00:36:12,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1667727144] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:36:12,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [250018696] [2024-11-19 00:36:12,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:36:12,670 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 00:36:12,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 00:36:12,672 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-19 00:36:12,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2024-11-19 00:36:13,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:36:13,981 INFO L255 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-19 00:36:13,987 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:36:14,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 00:36:14,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2024-11-19 00:36:14,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2024-11-19 00:36:14,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2024-11-19 00:36:14,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2024-11-19 00:36:15,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 59 [2024-11-19 00:36:15,382 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:36:15,383 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 176 treesize of output 80 [2024-11-19 00:36:15,403 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 152 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2024-11-19 00:36:15,403 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:36:15,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [250018696] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:36:15,475 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 00:36:15,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2024-11-19 00:36:15,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397168418] [2024-11-19 00:36:15,476 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 00:36:15,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-19 00:36:15,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:36:15,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 00:36:15,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2024-11-19 00:36:15,478 INFO L87 Difference]: Start difference. First operand 130 states and 177 transitions. Second operand has 16 states, 16 states have (on average 8.25) internal successors, (132), 15 states have internal predecessors, (132), 4 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) [2024-11-19 00:36:18,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:36:18,590 INFO L93 Difference]: Finished difference Result 379 states and 518 transitions. [2024-11-19 00:36:18,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 00:36:18,591 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 8.25) internal successors, (132), 15 states have internal predecessors, (132), 4 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) Word has length 172 [2024-11-19 00:36:18,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:36:18,592 INFO L225 Difference]: With dead ends: 379 [2024-11-19 00:36:18,592 INFO L226 Difference]: Without dead ends: 252 [2024-11-19 00:36:18,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 372 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=129, Invalid=521, Unknown=0, NotChecked=0, Total=650 [2024-11-19 00:36:18,593 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 549 mSDsluCounter, 1025 mSDsCounter, 0 mSdLazyCounter, 851 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 1164 SdHoareTripleChecker+Invalid, 972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-19 00:36:18,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 1164 Invalid, 972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 851 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-19 00:36:18,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-11-19 00:36:18,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 208. [2024-11-19 00:36:18,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 164 states have (on average 1.274390243902439) internal successors, (209), 164 states have internal predecessors, (209), 40 states have call successors, (40), 3 states have call predecessors, (40), 3 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-19 00:36:18,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 289 transitions. [2024-11-19 00:36:18,609 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 289 transitions. Word has length 172 [2024-11-19 00:36:18,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:36:18,609 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 289 transitions. [2024-11-19 00:36:18,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 8.25) internal successors, (132), 15 states have internal predecessors, (132), 4 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) [2024-11-19 00:36:18,609 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 289 transitions. [2024-11-19 00:36:18,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-19 00:36:18,612 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:36:18,612 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:36:18,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 0 [2024-11-19 00:36:18,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-19 00:36:19,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-19 00:36:19,013 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:36:19,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:36:19,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1733125341, now seen corresponding path program 1 times [2024-11-19 00:36:19,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:36:19,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1082808294] [2024-11-19 00:36:19,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:36:19,015 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-19 00:36:19,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:36:19,017 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-19 00:36:19,018 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-19 00:36:19,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:36:19,266 INFO L255 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 00:36:19,269 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:36:19,350 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 79 treesize of output 43 [2024-11-19 00:36:19,384 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 216 proven. 8 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2024-11-19 00:36:19,384 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:36:19,534 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 49 treesize of output 25 [2024-11-19 00:36:19,542 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-19 00:36:19,542 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:36:19,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1082808294] [2024-11-19 00:36:19,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1082808294] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 00:36:19,543 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 00:36:19,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2024-11-19 00:36:19,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766920093] [2024-11-19 00:36:19,543 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 00:36:19,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 00:36:19,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:36:19,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 00:36:19,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-19 00:36:19,548 INFO L87 Difference]: Start difference. First operand 208 states and 289 transitions. Second operand has 12 states, 11 states have (on average 8.545454545454545) internal successors, (94), 12 states have internal predecessors, (94), 4 states have call successors, (41), 3 states have call predecessors, (41), 4 states have return successors, (41), 3 states have call predecessors, (41), 4 states have call successors, (41) [2024-11-19 00:36:20,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:36:20,678 INFO L93 Difference]: Finished difference Result 428 states and 592 transitions. [2024-11-19 00:36:20,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 00:36:20,684 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.545454545454545) internal successors, (94), 12 states have internal predecessors, (94), 4 states have call successors, (41), 3 states have call predecessors, (41), 4 states have return successors, (41), 3 states have call predecessors, (41), 4 states have call successors, (41) Word has length 174 [2024-11-19 00:36:20,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:36:20,685 INFO L225 Difference]: With dead ends: 428 [2024-11-19 00:36:20,685 INFO L226 Difference]: Without dead ends: 212 [2024-11-19 00:36:20,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 337 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2024-11-19 00:36:20,687 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 145 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:36:20,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 692 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-19 00:36:20,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-11-19 00:36:20,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 206. [2024-11-19 00:36:20,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 162 states have (on average 1.2654320987654322) internal successors, (205), 162 states have internal predecessors, (205), 40 states have call successors, (40), 3 states have call predecessors, (40), 3 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-19 00:36:20,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 285 transitions. [2024-11-19 00:36:20,704 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 285 transitions. Word has length 174 [2024-11-19 00:36:20,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:36:20,704 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 285 transitions. [2024-11-19 00:36:20,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.545454545454545) internal successors, (94), 12 states have internal predecessors, (94), 4 states have call successors, (41), 3 states have call predecessors, (41), 4 states have return successors, (41), 3 states have call predecessors, (41), 4 states have call successors, (41) [2024-11-19 00:36:20,705 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 285 transitions. [2024-11-19 00:36:20,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-19 00:36:20,706 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:36:20,706 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:36:20,717 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-19 00:36:20,907 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-19 00:36:20,907 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:36:20,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:36:20,908 INFO L85 PathProgramCache]: Analyzing trace with hash 633954736, now seen corresponding path program 1 times [2024-11-19 00:36:20,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:36:20,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [240183022] [2024-11-19 00:36:20,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:36:20,908 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-19 00:36:20,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:36:20,909 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-19 00:36:20,910 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-19 00:36:21,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:36:21,293 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-19 00:36:21,298 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:36:21,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 00:36:21,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 32 [2024-11-19 00:36:21,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 32 [2024-11-19 00:36:21,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 32 [2024-11-19 00:36:21,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 32 [2024-11-19 00:36:21,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 65 [2024-11-19 00:36:22,036 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:36:22,036 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 194 treesize of output 80 [2024-11-19 00:36:22,081 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 152 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2024-11-19 00:36:22,082 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:36:22,189 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:36:22,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [240183022] [2024-11-19 00:36:22,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [240183022] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:36:22,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [904708073] [2024-11-19 00:36:22,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:36:22,189 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 00:36:22,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 00:36:22,190 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-19 00:36:22,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2024-11-19 00:36:23,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:36:23,828 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-19 00:36:23,833 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:36:23,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 00:36:24,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2024-11-19 00:36:24,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2024-11-19 00:36:24,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2024-11-19 00:36:24,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2024-11-19 00:36:24,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 59 [2024-11-19 00:36:25,005 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:36:25,005 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 176 treesize of output 80 [2024-11-19 00:36:25,025 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 152 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2024-11-19 00:36:25,025 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:36:25,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [904708073] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:36:25,090 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 00:36:25,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2024-11-19 00:36:25,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34867560] [2024-11-19 00:36:25,091 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 00:36:25,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-19 00:36:25,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:36:25,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-19 00:36:25,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2024-11-19 00:36:25,092 INFO L87 Difference]: Start difference. First operand 206 states and 285 transitions. Second operand has 17 states, 17 states have (on average 7.9411764705882355) internal successors, (135), 16 states have internal predecessors, (135), 4 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) [2024-11-19 00:36:27,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:36:27,860 INFO L93 Difference]: Finished difference Result 451 states and 619 transitions. [2024-11-19 00:36:27,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 00:36:27,861 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 7.9411764705882355) internal successors, (135), 16 states have internal predecessors, (135), 4 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) Word has length 174 [2024-11-19 00:36:27,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:36:27,862 INFO L225 Difference]: With dead ends: 451 [2024-11-19 00:36:27,862 INFO L226 Difference]: Without dead ends: 248 [2024-11-19 00:36:27,863 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 378 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=148, Invalid=664, Unknown=0, NotChecked=0, Total=812 [2024-11-19 00:36:27,863 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 563 mSDsluCounter, 1087 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 1224 SdHoareTripleChecker+Invalid, 968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-19 00:36:27,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [563 Valid, 1224 Invalid, 968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 839 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-19 00:36:27,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2024-11-19 00:36:27,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 208. [2024-11-19 00:36:27,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 164 states have (on average 1.2682926829268293) internal successors, (208), 164 states have internal predecessors, (208), 40 states have call successors, (40), 3 states have call predecessors, (40), 3 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-19 00:36:27,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 288 transitions. [2024-11-19 00:36:27,876 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 288 transitions. Word has length 174 [2024-11-19 00:36:27,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:36:27,876 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 288 transitions. [2024-11-19 00:36:27,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.9411764705882355) internal successors, (135), 16 states have internal predecessors, (135), 4 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) [2024-11-19 00:36:27,876 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 288 transitions. [2024-11-19 00:36:27,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-19 00:36:27,877 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:36:27,878 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:36:27,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Ended with exit code 0 [2024-11-19 00:36:28,092 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-19 00:36:28,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-19 00:36:28,278 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:36:28,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:36:28,279 INFO L85 PathProgramCache]: Analyzing trace with hash 156912928, now seen corresponding path program 1 times [2024-11-19 00:36:28,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:36:28,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1816156423] [2024-11-19 00:36:28,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:36:28,280 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-19 00:36:28,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:36:28,282 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-19 00:36:28,283 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-19 00:36:28,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:36:28,539 INFO L255 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 00:36:28,542 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:36:28,556 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-19 00:36:28,557 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:36:28,557 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:36:28,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1816156423] [2024-11-19 00:36:28,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1816156423] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:36:28,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:36:28,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:36:28,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973596501] [2024-11-19 00:36:28,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:36:28,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:36:28,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:36:28,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:36:28,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:36:28,559 INFO L87 Difference]: Start difference. First operand 208 states and 288 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-19 00:36:28,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:36:28,592 INFO L93 Difference]: Finished difference Result 416 states and 577 transitions. [2024-11-19 00:36:28,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:36:28,593 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 174 [2024-11-19 00:36:28,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:36:28,595 INFO L225 Difference]: With dead ends: 416 [2024-11-19 00:36:28,595 INFO L226 Difference]: Without dead ends: 211 [2024-11-19 00:36:28,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 170 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-19 00:36:28,596 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:36:28,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 611 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:36:28,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-19 00:36:28,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2024-11-19 00:36:28,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 167 states have (on average 1.2634730538922156) internal successors, (211), 167 states have internal predecessors, (211), 40 states have call successors, (40), 3 states have call predecessors, (40), 3 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-19 00:36:28,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 291 transitions. [2024-11-19 00:36:28,611 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 291 transitions. Word has length 174 [2024-11-19 00:36:28,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:36:28,611 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 291 transitions. [2024-11-19 00:36:28,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-19 00:36:28,612 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 291 transitions. [2024-11-19 00:36:28,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-19 00:36:28,613 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:36:28,613 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:36:28,624 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-19 00:36:28,813 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-19 00:36:28,814 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:36:28,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:36:28,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1388297179, now seen corresponding path program 1 times [2024-11-19 00:36:28,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:36:28,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1432315487] [2024-11-19 00:36:28,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:36:28,815 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-19 00:36:28,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:36:28,816 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-19 00:36:28,821 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-19 00:36:29,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:36:29,160 INFO L255 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-19 00:36:29,165 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:36:29,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 00:36:29,321 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 66 treesize of output 30 [2024-11-19 00:36:29,361 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 66 treesize of output 30 [2024-11-19 00:36:29,402 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 66 treesize of output 30 [2024-11-19 00:36:29,438 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 66 treesize of output 30 [2024-11-19 00:36:29,795 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 111 treesize of output 63 [2024-11-19 00:36:29,859 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:36:29,860 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 192 treesize of output 78 [2024-11-19 00:36:29,893 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 18 proven. 206 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2024-11-19 00:36:29,893 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:36:29,979 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:36:29,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1432315487] [2024-11-19 00:36:29,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1432315487] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:36:29,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1439217029] [2024-11-19 00:36:29,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:36:29,980 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 00:36:29,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 00:36:29,982 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-19 00:36:29,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2024-11-19 00:36:31,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:36:31,395 INFO L255 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-19 00:36:31,399 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:36:31,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 00:36:31,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 30 [2024-11-19 00:36:31,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 30 [2024-11-19 00:36:31,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 30 [2024-11-19 00:36:31,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 30 [2024-11-19 00:36:32,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 57 [2024-11-19 00:36:32,611 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:36:32,612 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 78 [2024-11-19 00:36:32,626 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 18 proven. 206 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2024-11-19 00:36:32,627 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:36:32,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1439217029] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:36:32,683 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 00:36:32,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2024-11-19 00:36:32,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421469155] [2024-11-19 00:36:32,683 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 00:36:32,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-19 00:36:32,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:36:32,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-19 00:36:32,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=502, Unknown=0, NotChecked=0, Total=600 [2024-11-19 00:36:32,685 INFO L87 Difference]: Start difference. First operand 211 states and 291 transitions. Second operand has 22 states, 20 states have (on average 7.1) internal successors, (142), 19 states have internal predecessors, (142), 6 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 4 states have call predecessors, (42), 6 states have call successors, (42) [2024-11-19 00:36:36,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:36:36,247 INFO L93 Difference]: Finished difference Result 482 states and 651 transitions. [2024-11-19 00:36:36,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-19 00:36:36,248 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 7.1) internal successors, (142), 19 states have internal predecessors, (142), 6 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 4 states have call predecessors, (42), 6 states have call successors, (42) Word has length 174 [2024-11-19 00:36:36,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:36:36,249 INFO L225 Difference]: With dead ends: 482 [2024-11-19 00:36:36,249 INFO L226 Difference]: Without dead ends: 274 [2024-11-19 00:36:36,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 369 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=327, Invalid=1313, Unknown=0, NotChecked=0, Total=1640 [2024-11-19 00:36:36,250 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 553 mSDsluCounter, 1271 mSDsCounter, 0 mSdLazyCounter, 1235 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 1388 SdHoareTripleChecker+Invalid, 1375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 1235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:36:36,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 1388 Invalid, 1375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 1235 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-19 00:36:36,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-11-19 00:36:36,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 215. [2024-11-19 00:36:36,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 170 states have (on average 1.2588235294117647) internal successors, (214), 170 states have internal predecessors, (214), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-19 00:36:36,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 294 transitions. [2024-11-19 00:36:36,265 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 294 transitions. Word has length 174 [2024-11-19 00:36:36,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:36:36,266 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 294 transitions. [2024-11-19 00:36:36,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 7.1) internal successors, (142), 19 states have internal predecessors, (142), 6 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 4 states have call predecessors, (42), 6 states have call successors, (42) [2024-11-19 00:36:36,266 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 294 transitions. [2024-11-19 00:36:36,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-19 00:36:36,267 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:36:36,267 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:36:36,277 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 (16)] Forceful destruction successful, exit code 0 [2024-11-19 00:36:36,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Forceful destruction successful, exit code 0 [2024-11-19 00:36:36,667 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,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-19 00:36:36,668 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:36:36,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:36:36,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1422318221, now seen corresponding path program 1 times [2024-11-19 00:36:36,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:36:36,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [523710234] [2024-11-19 00:36:36,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:36:36,670 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-19 00:36:36,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:36:36,671 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-19 00:36:36,671 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-19 00:36:36,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:36:36,937 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 00:36:36,940 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:36:36,947 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 14 treesize of output 10 [2024-11-19 00:36:36,987 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 40 treesize of output 22 [2024-11-19 00:36:37,004 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-19 00:36:37,005 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:36:37,005 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:36:37,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [523710234] [2024-11-19 00:36:37,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [523710234] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:36:37,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:36:37,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:36:37,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571794668] [2024-11-19 00:36:37,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:36:37,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:36:37,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:36:37,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:36:37,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:36:37,007 INFO L87 Difference]: Start difference. First operand 215 states and 294 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-19 00:36:37,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:36:37,255 INFO L93 Difference]: Finished difference Result 371 states and 511 transitions. [2024-11-19 00:36:37,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:36:37,256 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 176 [2024-11-19 00:36:37,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:36:37,260 INFO L225 Difference]: With dead ends: 371 [2024-11-19 00:36:37,260 INFO L226 Difference]: Without dead ends: 369 [2024-11-19 00:36:37,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:36:37,261 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 130 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 1052 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:36:37,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 1052 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:36:37,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-11-19 00:36:37,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 218. [2024-11-19 00:36:37,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 173 states have (on average 1.254335260115607) internal successors, (217), 173 states have internal predecessors, (217), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-19 00:36:37,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 297 transitions. [2024-11-19 00:36:37,284 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 297 transitions. Word has length 176 [2024-11-19 00:36:37,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:36:37,284 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 297 transitions. [2024-11-19 00:36:37,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-19 00:36:37,284 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 297 transitions. [2024-11-19 00:36:37,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-19 00:36:37,285 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:36:37,285 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:36:37,295 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 (18)] Ended with exit code 0 [2024-11-19 00:36:37,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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-19 00:36:37,486 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:36:37,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:36:37,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1420471179, now seen corresponding path program 1 times [2024-11-19 00:36:37,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:36:37,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2087459414] [2024-11-19 00:36:37,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:36:37,487 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-19 00:36:37,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:36:37,488 INFO L229 MonitoredProcess]: Starting monitored process 19 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-19 00:36:37,489 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 (19)] Waiting until timeout for monitored process [2024-11-19 00:36:37,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:36:37,863 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-19 00:36:37,866 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:36:37,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 00:36:37,872 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 14 treesize of output 10 [2024-11-19 00:36:37,900 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 25 treesize of output 24 [2024-11-19 00:36:37,961 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:36:37,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2024-11-19 00:36:38,033 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:36:38,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 49 [2024-11-19 00:36:38,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2024-11-19 00:36:38,215 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 392 proven. 0 refuted. 0 times theorem prover too weak. 448 trivial. 0 not checked. [2024-11-19 00:36:38,215 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:36:38,215 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:36:38,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2087459414] [2024-11-19 00:36:38,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2087459414] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:36:38,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:36:38,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 00:36:38,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40828658] [2024-11-19 00:36:38,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:36:38,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 00:36:38,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:36:38,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 00:36:38,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:36:38,216 INFO L87 Difference]: Start difference. First operand 218 states and 297 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2024-11-19 00:36:38,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:36:38,576 INFO L93 Difference]: Finished difference Result 544 states and 743 transitions. [2024-11-19 00:36:38,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:36:38,576 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 176 [2024-11-19 00:36:38,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:36:38,578 INFO L225 Difference]: With dead ends: 544 [2024-11-19 00:36:38,578 INFO L226 Difference]: Without dead ends: 329 [2024-11-19 00:36:38,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:36:38,579 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 194 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:36:38,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 655 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:36:38,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2024-11-19 00:36:38,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 327. [2024-11-19 00:36:38,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 254 states have (on average 1.2519685039370079) internal successors, (318), 256 states have internal predecessors, (318), 64 states have call successors, (64), 8 states have call predecessors, (64), 8 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-19 00:36:38,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 446 transitions. [2024-11-19 00:36:38,612 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 446 transitions. Word has length 176 [2024-11-19 00:36:38,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:36:38,612 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 446 transitions. [2024-11-19 00:36:38,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2024-11-19 00:36:38,613 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 446 transitions. [2024-11-19 00:36:38,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-19 00:36:38,613 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:36:38,614 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:36:38,623 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 (19)] Ended with exit code 0 [2024-11-19 00:36:38,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /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-19 00:36:38,815 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:36:38,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:36:38,815 INFO L85 PathProgramCache]: Analyzing trace with hash 354536183, now seen corresponding path program 1 times [2024-11-19 00:36:38,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:36:38,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [396725536] [2024-11-19 00:36:38,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:36:38,816 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-19 00:36:38,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:36:38,818 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-19 00:36:38,820 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-19 00:36:39,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:36:39,184 INFO L255 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-19 00:36:39,187 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:36:39,191 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 14 treesize of output 10 [2024-11-19 00:36:39,229 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 25 treesize of output 24 [2024-11-19 00:36:39,294 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:36:39,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2024-11-19 00:36:39,360 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:36:39,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 40 [2024-11-19 00:36:39,364 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 14 treesize of output 10 [2024-11-19 00:36:39,519 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 36 [2024-11-19 00:36:39,523 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:36:39,523 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 56 treesize of output 32 [2024-11-19 00:36:39,538 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 392 proven. 0 refuted. 0 times theorem prover too weak. 448 trivial. 0 not checked. [2024-11-19 00:36:39,538 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:36:39,538 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:36:39,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [396725536] [2024-11-19 00:36:39,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [396725536] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:36:39,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:36:39,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 00:36:39,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195994540] [2024-11-19 00:36:39,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:36:39,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 00:36:39,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:36:39,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 00:36:39,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:36:39,542 INFO L87 Difference]: Start difference. First operand 327 states and 446 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2024-11-19 00:36:39,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:36:39,917 INFO L93 Difference]: Finished difference Result 568 states and 765 transitions. [2024-11-19 00:36:39,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:36:39,917 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 176 [2024-11-19 00:36:39,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:36:39,919 INFO L225 Difference]: With dead ends: 568 [2024-11-19 00:36:39,919 INFO L226 Difference]: Without dead ends: 345 [2024-11-19 00:36:39,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:36:39,926 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 318 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:36:39,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 666 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:36:39,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-11-19 00:36:39,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 343. [2024-11-19 00:36:39,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 264 states have (on average 1.2386363636363635) internal successors, (327), 266 states have internal predecessors, (327), 68 states have call successors, (68), 10 states have call predecessors, (68), 10 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-19 00:36:39,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 463 transitions. [2024-11-19 00:36:39,958 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 463 transitions. Word has length 176 [2024-11-19 00:36:39,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:36:39,958 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 463 transitions. [2024-11-19 00:36:39,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2024-11-19 00:36:39,959 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 463 transitions. [2024-11-19 00:36:39,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-19 00:36:39,959 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:36:39,960 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:36:39,970 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-19 00:36:40,160 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 [2024-11-19 00:36:40,160 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:36:40,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:36:40,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1034594553, now seen corresponding path program 1 times [2024-11-19 00:36:40,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:36:40,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1076294773] [2024-11-19 00:36:40,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:36:40,161 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-19 00:36:40,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:36:40,163 INFO L229 MonitoredProcess]: Starting monitored process 21 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-19 00:36:40,164 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 (21)] Waiting until timeout for monitored process [2024-11-19 00:36:40,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:36:40,533 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-19 00:36:40,537 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:36:40,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 00:36:40,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2024-11-19 00:36:40,808 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:36:40,808 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 71 treesize of output 35 [2024-11-19 00:36:40,835 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 98 proven. 57 refuted. 0 times theorem prover too weak. 685 trivial. 0 not checked. [2024-11-19 00:36:40,835 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:36:40,927 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-19 00:36:40,928 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:36:40,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1076294773] [2024-11-19 00:36:40,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1076294773] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 00:36:40,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:36:40,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2024-11-19 00:36:40,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521674245] [2024-11-19 00:36:40,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:36:40,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:36:40,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:36:40,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:36:40,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-19 00:36:40,929 INFO L87 Difference]: Start difference. First operand 343 states and 463 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-19 00:36:41,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:36:41,063 INFO L93 Difference]: Finished difference Result 633 states and 839 transitions. [2024-11-19 00:36:41,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:36:41,064 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 176 [2024-11-19 00:36:41,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:36:41,068 INFO L225 Difference]: With dead ends: 633 [2024-11-19 00:36:41,068 INFO L226 Difference]: Without dead ends: 402 [2024-11-19 00:36:41,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-19 00:36:41,069 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 38 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:36:41,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 778 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:36:41,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2024-11-19 00:36:41,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 376. [2024-11-19 00:36:41,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 297 states have (on average 1.2491582491582491) internal successors, (371), 299 states have internal predecessors, (371), 68 states have call successors, (68), 10 states have call predecessors, (68), 10 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-19 00:36:41,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 507 transitions. [2024-11-19 00:36:41,110 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 507 transitions. Word has length 176 [2024-11-19 00:36:41,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:36:41,112 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 507 transitions. [2024-11-19 00:36:41,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-19 00:36:41,112 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 507 transitions. [2024-11-19 00:36:41,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-19 00:36:41,113 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:36:41,113 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:36:41,123 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 (21)] Ended with exit code 0 [2024-11-19 00:36:41,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /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-19 00:36:41,314 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:36:41,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:36:41,314 INFO L85 PathProgramCache]: Analyzing trace with hash 776429115, now seen corresponding path program 1 times [2024-11-19 00:36:41,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:36:41,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1925523326] [2024-11-19 00:36:41,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:36:41,315 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-19 00:36:41,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:36:41,316 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-19 00:36:41,316 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-19 00:36:41,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:36:41,597 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 00:36:41,599 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:36:41,624 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 19 treesize of output 13 [2024-11-19 00:36:41,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 13 treesize of output 9 [2024-11-19 00:36:41,751 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:36:41,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 34 [2024-11-19 00:36:41,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 38 treesize of output 26 [2024-11-19 00:36:41,924 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-19 00:36:41,924 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:36:41,924 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:36:41,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1925523326] [2024-11-19 00:36:41,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1925523326] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:36:41,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:36:41,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:36:41,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127365325] [2024-11-19 00:36:41,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:36:41,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:36:41,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:36:41,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:36:41,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:36:41,925 INFO L87 Difference]: Start difference. First operand 376 states and 507 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-19 00:36:46,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 00:36:47,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:36:47,582 INFO L93 Difference]: Finished difference Result 611 states and 812 transitions. [2024-11-19 00:36:47,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:36:47,584 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 176 [2024-11-19 00:36:47,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:36:47,586 INFO L225 Difference]: With dead ends: 611 [2024-11-19 00:36:47,586 INFO L226 Difference]: Without dead ends: 347 [2024-11-19 00:36:47,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:36:47,587 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 95 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:36:47,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 672 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2024-11-19 00:36:47,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2024-11-19 00:36:47,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2024-11-19 00:36:47,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 266 states have (on average 1.2218045112781954) internal successors, (325), 268 states have internal predecessors, (325), 68 states have call successors, (68), 12 states have call predecessors, (68), 12 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-19 00:36:47,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 461 transitions. [2024-11-19 00:36:47,627 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 461 transitions. Word has length 176 [2024-11-19 00:36:47,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:36:47,628 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 461 transitions. [2024-11-19 00:36:47,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-19 00:36:47,628 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 461 transitions. [2024-11-19 00:36:47,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-19 00:36:47,629 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:36:47,629 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:36:47,637 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-19 00:36:47,829 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-19 00:36:47,829 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:36:47,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:36:47,830 INFO L85 PathProgramCache]: Analyzing trace with hash -392417034, now seen corresponding path program 1 times [2024-11-19 00:36:47,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:36:47,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1202416570] [2024-11-19 00:36:47,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:36:47,830 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:36:47,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:36:47,831 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-19 00:36:47,833 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-19 00:36:48,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:36:48,239 INFO L255 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-19 00:36:48,243 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:36:48,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 00:36:51,474 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 66 treesize of output 30 [2024-11-19 00:36:52,215 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 66 treesize of output 30 [2024-11-19 00:36:52,987 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 66 treesize of output 30 [2024-11-19 00:36:53,612 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 66 treesize of output 30 [2024-11-19 00:37:00,154 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 111 treesize of output 63 [2024-11-19 00:37:01,230 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:37:01,230 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 192 treesize of output 78 [2024-11-19 00:37:02,365 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 18 proven. 206 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2024-11-19 00:37:02,365 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:37:04,463 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:37:04,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1202416570] [2024-11-19 00:37:04,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1202416570] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:37:04,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [871488165] [2024-11-19 00:37:04,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:37:04,463 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 00:37:04,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 00:37:04,466 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-19 00:37:04,467 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-19 00:37:06,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:37:06,135 INFO L255 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-19 00:37:06,139 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:37:10,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 00:37:15,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32