./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-96.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-96.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 fdbb2557d13c4ebf5afc59b31f2554eb4dac84eb5f5361696929e0578cc40049 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 09:21:22,758 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 09:21:22,841 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 09:21:22,846 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 09:21:22,846 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 09:21:22,876 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 09:21:22,877 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 09:21:22,877 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 09:21:22,883 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 09:21:22,884 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 09:21:22,884 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 09:21:22,884 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 09:21:22,884 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 09:21:22,885 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 09:21:22,885 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 09:21:22,885 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 09:21:22,885 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 09:21:22,885 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 09:21:22,886 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 09:21:22,886 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 09:21:22,886 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 09:21:22,891 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 09:21:22,891 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 09:21:22,891 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 09:21:22,891 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 09:21:22,891 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 09:21:22,892 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 09:21:22,892 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 09:21:22,892 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 09:21:22,892 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 09:21:22,892 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 09:21:22,892 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 09:21:22,892 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:21:22,893 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 09:21:22,893 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 09:21:22,893 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 09:21:22,893 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 09:21:22,893 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 09:21:22,893 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 09:21:22,893 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 09:21:22,894 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 09:21:22,894 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 09:21:22,894 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 -> fdbb2557d13c4ebf5afc59b31f2554eb4dac84eb5f5361696929e0578cc40049 [2024-11-10 09:21:23,086 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 09:21:23,107 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 09:21:23,111 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 09:21:23,111 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 09:21:23,112 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 09:21:23,113 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-96.i [2024-11-10 09:21:24,461 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 09:21:24,649 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 09:21:24,650 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-96.i [2024-11-10 09:21:24,664 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab3caaa81/74f112e55d85450189d77c3e926c7579/FLAG4dce8a629 [2024-11-10 09:21:24,676 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab3caaa81/74f112e55d85450189d77c3e926c7579 [2024-11-10 09:21:24,678 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 09:21:24,680 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 09:21:24,681 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 09:21:24,681 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 09:21:24,704 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 09:21:24,705 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:21:24" (1/1) ... [2024-11-10 09:21:24,706 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@249d9db2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:24, skipping insertion in model container [2024-11-10 09:21:24,706 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:21:24" (1/1) ... [2024-11-10 09:21:24,735 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 09:21:24,910 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-96.i[916,929] [2024-11-10 09:21:24,962 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:21:24,970 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 09:21:24,981 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-96.i[916,929] [2024-11-10 09:21:25,028 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:21:25,052 INFO L204 MainTranslator]: Completed translation [2024-11-10 09:21:25,052 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:25 WrapperNode [2024-11-10 09:21:25,053 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 09:21:25,053 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 09:21:25,054 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 09:21:25,054 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 09:21:25,060 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:25" (1/1) ... [2024-11-10 09:21:25,071 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:25" (1/1) ... [2024-11-10 09:21:25,102 INFO L138 Inliner]: procedures = 29, calls = 160, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 486 [2024-11-10 09:21:25,103 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 09:21:25,103 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 09:21:25,104 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 09:21:25,104 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 09:21:25,113 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:25" (1/1) ... [2024-11-10 09:21:25,116 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:25" (1/1) ... [2024-11-10 09:21:25,121 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:25" (1/1) ... [2024-11-10 09:21:25,140 INFO L175 MemorySlicer]: Split 127 memory accesses to 7 slices as follows [2, 32, 25, 3, 9, 15, 41]. 32 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 5, 3, 1, 2, 1, 3]. The 18 writes are split as follows [0, 6, 4, 1, 2, 1, 4]. [2024-11-10 09:21:25,140 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:25" (1/1) ... [2024-11-10 09:21:25,140 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:25" (1/1) ... [2024-11-10 09:21:25,167 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:25" (1/1) ... [2024-11-10 09:21:25,174 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:25" (1/1) ... [2024-11-10 09:21:25,177 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:25" (1/1) ... [2024-11-10 09:21:25,178 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:25" (1/1) ... [2024-11-10 09:21:25,183 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 09:21:25,184 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 09:21:25,184 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 09:21:25,184 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 09:21:25,185 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:25" (1/1) ... [2024-11-10 09:21:25,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:21:25,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:21:25,221 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 09:21:25,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 09:21:25,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 09:21:25,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-10 09:21:25,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-10 09:21:25,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-10 09:21:25,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-10 09:21:25,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-10 09:21:25,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-10 09:21:25,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-11-10 09:21:25,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 09:21:25,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 09:21:25,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-10 09:21:25,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-10 09:21:25,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-10 09:21:25,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-10 09:21:25,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-10 09:21:25,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-10 09:21:25,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-10 09:21:25,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-10 09:21:25,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-10 09:21:25,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-10 09:21:25,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-10 09:21:25,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-11-10 09:21:25,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 09:21:25,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 09:21:25,278 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-10 09:21:25,278 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-10 09:21:25,278 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-10 09:21:25,278 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-10 09:21:25,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-10 09:21:25,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-10 09:21:25,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-10 09:21:25,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-10 09:21:25,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-10 09:21:25,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-10 09:21:25,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-10 09:21:25,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-11-10 09:21:25,280 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 09:21:25,280 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 09:21:25,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 09:21:25,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 09:21:25,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-10 09:21:25,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-10 09:21:25,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-10 09:21:25,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-10 09:21:25,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-10 09:21:25,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 09:21:25,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 09:21:25,391 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 09:21:25,392 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 09:21:25,764 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L101: havoc property_#t~ite85#1;havoc property_#t~mem82#1;havoc property_#t~mem77#1;havoc property_#t~mem78#1;havoc property_#t~ite81#1;havoc property_#t~mem79#1;havoc property_#t~mem80#1;havoc property_#t~mem84#1;havoc property_#t~mem83#1;havoc property_#t~mem86#1;havoc property_#t~ite100#1;havoc property_#t~mem88#1;havoc property_#t~mem87#1;havoc property_#t~short89#1;havoc property_#t~ite99#1;havoc property_#t~mem90#1;havoc property_#t~ite98#1;havoc property_#t~mem95#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~short94#1;havoc property_#t~mem97#1;havoc property_#t~mem96#1;havoc property_#t~short101#1;havoc property_#t~mem102#1;havoc property_#t~ite105#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~mem106#1;havoc property_#t~ite121#1;havoc property_#t~mem107#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~ite114#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~ite120#1;havoc property_#t~mem117#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~mem119#1;havoc property_#t~mem118#1;havoc property_#t~short122#1;havoc property_#t~mem124#1;havoc property_#t~mem123#1;havoc property_#t~short125#1;havoc property_#t~mem127#1;havoc property_#t~mem126#1;havoc property_#t~short128#1;havoc property_#t~mem130#1;havoc property_#t~mem129#1;havoc property_#t~short131#1; [2024-11-10 09:21:25,794 INFO L? ?]: Removed 113 outVars from TransFormulas that were not future-live. [2024-11-10 09:21:25,795 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 09:21:25,809 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 09:21:25,809 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 09:21:25,810 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:21:25 BoogieIcfgContainer [2024-11-10 09:21:25,810 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 09:21:25,811 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 09:21:25,811 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 09:21:25,814 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 09:21:25,814 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:21:24" (1/3) ... [2024-11-10 09:21:25,815 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@df01109 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:21:25, skipping insertion in model container [2024-11-10 09:21:25,815 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:25" (2/3) ... [2024-11-10 09:21:25,816 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@df01109 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:21:25, skipping insertion in model container [2024-11-10 09:21:25,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:21:25" (3/3) ... [2024-11-10 09:21:25,818 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-96.i [2024-11-10 09:21:25,832 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 09:21:25,832 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 09:21:25,887 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 09:21:25,892 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;@5215455, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 09:21:25,892 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 09:21:25,896 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 92 states have (on average 1.4130434782608696) internal successors, (130), 93 states have internal predecessors, (130), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 09:21:25,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-10 09:21:25,907 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:25,908 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:25,908 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:25,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:25,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1860286907, now seen corresponding path program 1 times [2024-11-10 09:21:25,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:21:25,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071713063] [2024-11-10 09:21:25,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:25,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:21:26,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:26,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:21:26,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:26,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:21:26,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:26,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:21:26,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:26,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:21:26,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:26,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:21:26,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:26,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:21:26,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:26,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:21:26,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:26,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:21:26,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:26,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:21:26,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:26,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:21:26,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:26,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:21:26,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:26,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:21:26,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:26,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:21:26,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:26,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:21:26,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:26,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:21:26,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:26,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:21:26,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:26,417 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 09:21:26,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:21:26,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071713063] [2024-11-10 09:21:26,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071713063] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:26,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:26,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 09:21:26,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847997689] [2024-11-10 09:21:26,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:26,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 09:21:26,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:21:26,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 09:21:26,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:21:26,452 INFO L87 Difference]: Start difference. First operand has 111 states, 92 states have (on average 1.4130434782608696) internal successors, (130), 93 states have internal predecessors, (130), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 09:21:26,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:26,487 INFO L93 Difference]: Finished difference Result 214 states and 333 transitions. [2024-11-10 09:21:26,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 09:21:26,489 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 133 [2024-11-10 09:21:26,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:26,496 INFO L225 Difference]: With dead ends: 214 [2024-11-10 09:21:26,497 INFO L226 Difference]: Without dead ends: 106 [2024-11-10 09:21:26,501 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:21:26,505 INFO L432 NwaCegarLoop]: 154 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, 154 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:26,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:21:26,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-10 09:21:26,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-10 09:21:26,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 88 states have (on average 1.3863636363636365) internal successors, (122), 88 states have internal predecessors, (122), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 09:21:26,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 154 transitions. [2024-11-10 09:21:26,580 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 154 transitions. Word has length 133 [2024-11-10 09:21:26,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:26,580 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 154 transitions. [2024-11-10 09:21:26,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 09:21:26,581 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 154 transitions. [2024-11-10 09:21:26,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-10 09:21:26,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:26,589 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:26,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 09:21:26,590 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:26,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:26,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1366927273, now seen corresponding path program 1 times [2024-11-10 09:21:26,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:21:26,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890898942] [2024-11-10 09:21:26,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:26,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:21:26,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:26,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:21:26,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:26,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:21:26,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:26,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:21:26,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:26,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:21:26,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:26,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:21:26,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:26,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:21:26,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:26,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:21:26,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:26,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:21:26,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:26,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:21:26,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:26,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:21:26,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:26,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:21:26,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:26,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:21:26,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:26,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:21:26,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:26,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:21:26,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:26,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:21:26,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:26,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:21:26,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:26,931 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 09:21:26,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:21:26,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890898942] [2024-11-10 09:21:26,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890898942] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:26,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:26,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:21:26,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045083254] [2024-11-10 09:21:26,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:26,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:21:26,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:21:26,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:21:26,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:21:26,937 INFO L87 Difference]: Start difference. First operand 106 states and 154 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:21:26,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:26,985 INFO L93 Difference]: Finished difference Result 212 states and 309 transitions. [2024-11-10 09:21:26,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:21:26,986 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2024-11-10 09:21:26,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:26,991 INFO L225 Difference]: With dead ends: 212 [2024-11-10 09:21:26,991 INFO L226 Difference]: Without dead ends: 109 [2024-11-10 09:21:26,992 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:21:26,993 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 1 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 442 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-10 09:21:26,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 442 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:21:26,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-10 09:21:27,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2024-11-10 09:21:27,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 90 states have (on average 1.3777777777777778) internal successors, (124), 90 states have internal predecessors, (124), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 09:21:27,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 156 transitions. [2024-11-10 09:21:27,005 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 156 transitions. Word has length 133 [2024-11-10 09:21:27,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:27,006 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 156 transitions. [2024-11-10 09:21:27,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:21:27,007 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 156 transitions. [2024-11-10 09:21:27,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-10 09:21:27,009 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:27,009 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:27,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 09:21:27,010 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:27,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:27,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1170413768, now seen corresponding path program 1 times [2024-11-10 09:21:27,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:21:27,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865415570] [2024-11-10 09:21:27,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:27,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:21:27,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:27,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:21:27,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:27,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:21:27,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:27,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:21:27,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:27,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:21:27,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:27,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:21:27,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:27,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:21:27,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:27,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:21:27,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:27,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:21:27,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:27,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:21:27,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:27,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:21:27,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:27,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:21:27,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:27,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:21:27,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:27,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:21:27,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:27,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:21:27,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:27,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:21:27,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:27,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:21:27,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:27,234 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 09:21:27,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:21:27,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865415570] [2024-11-10 09:21:27,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865415570] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:27,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:27,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:21:27,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505393688] [2024-11-10 09:21:27,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:27,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:21:27,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:21:27,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:21:27,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:21:27,238 INFO L87 Difference]: Start difference. First operand 108 states and 156 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:21:27,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:27,271 INFO L93 Difference]: Finished difference Result 216 states and 313 transitions. [2024-11-10 09:21:27,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:21:27,272 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2024-11-10 09:21:27,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:27,273 INFO L225 Difference]: With dead ends: 216 [2024-11-10 09:21:27,273 INFO L226 Difference]: Without dead ends: 111 [2024-11-10 09:21:27,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:21:27,275 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 1 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 443 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-10 09:21:27,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 443 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:21:27,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-10 09:21:27,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2024-11-10 09:21:27,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 92 states have (on average 1.3695652173913044) internal successors, (126), 92 states have internal predecessors, (126), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 09:21:27,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 158 transitions. [2024-11-10 09:21:27,282 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 158 transitions. Word has length 133 [2024-11-10 09:21:27,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:27,283 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 158 transitions. [2024-11-10 09:21:27,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:21:27,283 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 158 transitions. [2024-11-10 09:21:27,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-10 09:21:27,284 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:27,284 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:27,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 09:21:27,285 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:27,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:27,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1381743193, now seen corresponding path program 1 times [2024-11-10 09:21:27,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:21:27,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525266294] [2024-11-10 09:21:27,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:27,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:21:27,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:27,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:21:27,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:27,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:21:27,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:27,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:21:27,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:27,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:21:27,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:27,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:21:27,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:27,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:21:27,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:27,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:21:27,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:27,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:21:27,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:27,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:21:27,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:27,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:21:27,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:27,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:21:27,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:27,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:21:27,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:27,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:21:27,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:27,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:21:27,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:27,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:21:27,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:27,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:21:27,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:27,391 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 09:21:27,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:21:27,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525266294] [2024-11-10 09:21:27,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525266294] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:27,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:27,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:21:27,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121745875] [2024-11-10 09:21:27,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:27,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:21:27,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:21:27,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:21:27,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:21:27,393 INFO L87 Difference]: Start difference. First operand 110 states and 158 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:21:27,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:27,410 INFO L93 Difference]: Finished difference Result 220 states and 317 transitions. [2024-11-10 09:21:27,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:21:27,411 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2024-11-10 09:21:27,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:27,412 INFO L225 Difference]: With dead ends: 220 [2024-11-10 09:21:27,412 INFO L226 Difference]: Without dead ends: 113 [2024-11-10 09:21:27,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:21:27,414 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 1 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 445 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-10 09:21:27,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 445 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:21:27,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-10 09:21:27,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2024-11-10 09:21:27,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 94 states have (on average 1.3617021276595744) internal successors, (128), 94 states have internal predecessors, (128), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 09:21:27,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 160 transitions. [2024-11-10 09:21:27,420 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 160 transitions. Word has length 133 [2024-11-10 09:21:27,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:27,420 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 160 transitions. [2024-11-10 09:21:27,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:21:27,421 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 160 transitions. [2024-11-10 09:21:27,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-10 09:21:27,422 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:27,422 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:27,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 09:21:27,422 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:27,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:27,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1353114042, now seen corresponding path program 1 times [2024-11-10 09:21:27,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:21:27,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645079282] [2024-11-10 09:21:27,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:27,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:21:27,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:27,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:21:27,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:27,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:21:27,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:27,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:21:27,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:27,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:21:27,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:27,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:21:27,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:27,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:21:27,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:27,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:21:27,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:27,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:21:27,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:27,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:21:27,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:27,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:21:27,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:27,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:21:27,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:27,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:21:27,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:27,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:21:27,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:27,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:21:27,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:27,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:21:27,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:27,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:21:27,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:27,608 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 09:21:27,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:21:27,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645079282] [2024-11-10 09:21:27,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645079282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:27,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:27,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:21:27,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044471182] [2024-11-10 09:21:27,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:27,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:21:27,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:21:27,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:21:27,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:21:27,611 INFO L87 Difference]: Start difference. First operand 112 states and 160 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:21:27,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:27,656 INFO L93 Difference]: Finished difference Result 223 states and 320 transitions. [2024-11-10 09:21:27,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:21:27,657 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2024-11-10 09:21:27,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:27,658 INFO L225 Difference]: With dead ends: 223 [2024-11-10 09:21:27,658 INFO L226 Difference]: Without dead ends: 114 [2024-11-10 09:21:27,659 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:21:27,660 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 1 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:27,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 575 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:21:27,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-10 09:21:27,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-11-10 09:21:27,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 96 states have (on average 1.3541666666666667) internal successors, (130), 96 states have internal predecessors, (130), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 09:21:27,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 162 transitions. [2024-11-10 09:21:27,666 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 162 transitions. Word has length 133 [2024-11-10 09:21:27,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:27,666 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 162 transitions. [2024-11-10 09:21:27,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:21:27,667 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 162 transitions. [2024-11-10 09:21:27,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-10 09:21:27,668 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:27,668 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:27,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 09:21:27,668 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:27,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:27,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1761938267, now seen corresponding path program 1 times [2024-11-10 09:21:27,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:21:27,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821047060] [2024-11-10 09:21:27,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:27,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:21:27,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:28,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:21:28,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:28,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:21:28,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:28,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:21:28,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:28,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:21:28,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:28,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:21:28,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:28,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:21:28,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:28,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:21:28,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:28,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:21:28,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:28,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:21:28,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:28,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:21:28,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:28,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:21:28,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:28,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:21:28,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:28,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:21:28,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:28,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:21:28,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:28,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:21:28,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:28,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:21:28,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:28,212 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 09:21:28,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:21:28,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821047060] [2024-11-10 09:21:28,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821047060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:28,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:28,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 09:21:28,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344184555] [2024-11-10 09:21:28,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:28,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:21:28,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:21:28,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:21:28,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:21:28,214 INFO L87 Difference]: Start difference. First operand 114 states and 162 transitions. Second operand has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 09:21:28,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:28,361 INFO L93 Difference]: Finished difference Result 326 states and 465 transitions. [2024-11-10 09:21:28,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:21:28,361 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 133 [2024-11-10 09:21:28,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:28,362 INFO L225 Difference]: With dead ends: 326 [2024-11-10 09:21:28,363 INFO L226 Difference]: Without dead ends: 215 [2024-11-10 09:21:28,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-10 09:21:28,364 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 127 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 960 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:28,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 960 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:21:28,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-10 09:21:28,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 211. [2024-11-10 09:21:28,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 180 states have (on average 1.3666666666666667) internal successors, (246), 181 states have internal predecessors, (246), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-10 09:21:28,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 302 transitions. [2024-11-10 09:21:28,378 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 302 transitions. Word has length 133 [2024-11-10 09:21:28,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:28,378 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 302 transitions. [2024-11-10 09:21:28,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 09:21:28,378 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 302 transitions. [2024-11-10 09:21:28,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-10 09:21:28,379 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:28,380 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:28,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 09:21:28,380 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:28,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:28,380 INFO L85 PathProgramCache]: Analyzing trace with hash 983251047, now seen corresponding path program 1 times [2024-11-10 09:21:28,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:21:28,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391271191] [2024-11-10 09:21:28,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:28,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:21:28,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:28,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:21:28,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:28,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:21:28,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:28,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:21:28,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:28,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:21:28,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:28,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:21:28,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:28,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:21:28,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:28,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:21:28,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:28,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:21:28,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:28,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:21:28,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:28,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:21:28,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:28,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:21:28,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:28,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:21:28,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:28,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:21:28,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:28,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:21:28,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:28,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:21:28,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:28,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:21:28,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:28,460 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 09:21:28,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:21:28,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391271191] [2024-11-10 09:21:28,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391271191] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:28,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:28,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 09:21:28,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427817042] [2024-11-10 09:21:28,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:28,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 09:21:28,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:21:28,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 09:21:28,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 09:21:28,462 INFO L87 Difference]: Start difference. First operand 211 states and 302 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:21:28,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:28,481 INFO L93 Difference]: Finished difference Result 460 states and 655 transitions. [2024-11-10 09:21:28,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 09:21:28,482 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 135 [2024-11-10 09:21:28,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:28,484 INFO L225 Difference]: With dead ends: 460 [2024-11-10 09:21:28,484 INFO L226 Difference]: Without dead ends: 252 [2024-11-10 09:21:28,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 09:21:28,486 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 68 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:28,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 332 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:21:28,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-11-10 09:21:28,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 211. [2024-11-10 09:21:28,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 180 states have (on average 1.3611111111111112) internal successors, (245), 181 states have internal predecessors, (245), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-10 09:21:28,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 301 transitions. [2024-11-10 09:21:28,495 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 301 transitions. Word has length 135 [2024-11-10 09:21:28,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:28,496 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 301 transitions. [2024-11-10 09:21:28,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:21:28,496 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 301 transitions. [2024-11-10 09:21:28,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-10 09:21:28,497 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:28,497 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:28,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 09:21:28,498 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:28,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:28,498 INFO L85 PathProgramCache]: Analyzing trace with hash 161600743, now seen corresponding path program 1 times [2024-11-10 09:21:28,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:21:28,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715931851] [2024-11-10 09:21:28,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:28,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:21:28,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:28,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:21:28,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:28,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:21:28,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:28,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:21:28,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:28,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:21:28,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:28,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:21:28,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:28,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:21:28,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:28,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:21:28,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:28,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:21:28,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:28,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:21:28,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:28,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:21:28,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:28,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:21:28,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:28,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:21:28,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:28,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:21:28,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:28,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:21:28,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:28,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:21:28,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:28,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:21:28,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:28,578 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 09:21:28,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:21:28,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715931851] [2024-11-10 09:21:28,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715931851] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:28,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:28,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 09:21:28,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057913683] [2024-11-10 09:21:28,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:28,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 09:21:28,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:21:28,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 09:21:28,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 09:21:28,580 INFO L87 Difference]: Start difference. First operand 211 states and 301 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:21:28,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:28,599 INFO L93 Difference]: Finished difference Result 420 states and 597 transitions. [2024-11-10 09:21:28,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 09:21:28,600 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 135 [2024-11-10 09:21:28,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:28,601 INFO L225 Difference]: With dead ends: 420 [2024-11-10 09:21:28,601 INFO L226 Difference]: Without dead ends: 212 [2024-11-10 09:21:28,602 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 09:21:28,603 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 66 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:28,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 295 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:21:28,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-11-10 09:21:28,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 207. [2024-11-10 09:21:28,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 176 states have (on average 1.3522727272727273) internal successors, (238), 177 states have internal predecessors, (238), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-10 09:21:28,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 294 transitions. [2024-11-10 09:21:28,619 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 294 transitions. Word has length 135 [2024-11-10 09:21:28,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:28,619 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 294 transitions. [2024-11-10 09:21:28,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:21:28,620 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 294 transitions. [2024-11-10 09:21:28,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-10 09:21:28,623 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:28,623 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:28,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 09:21:28,623 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:28,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:28,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1050235475, now seen corresponding path program 1 times [2024-11-10 09:21:28,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:21:28,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808532638] [2024-11-10 09:21:28,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:28,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:21:28,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:28,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:21:28,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:28,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:21:28,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:28,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:21:28,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:28,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:21:28,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:28,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:21:28,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:28,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:21:28,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:28,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:21:28,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:28,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:21:28,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:28,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:21:28,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:28,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:21:28,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:28,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:21:28,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:28,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:21:28,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:28,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:21:28,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:28,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:21:28,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:28,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:21:28,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:28,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:21:28,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:28,816 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 09:21:28,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:21:28,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808532638] [2024-11-10 09:21:28,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808532638] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:28,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:28,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:21:28,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957244790] [2024-11-10 09:21:28,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:28,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:21:28,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:21:28,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:21:28,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:21:28,818 INFO L87 Difference]: Start difference. First operand 207 states and 294 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:21:28,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:28,844 INFO L93 Difference]: Finished difference Result 417 states and 593 transitions. [2024-11-10 09:21:28,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:21:28,845 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 135 [2024-11-10 09:21:28,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:28,847 INFO L225 Difference]: With dead ends: 417 [2024-11-10 09:21:28,847 INFO L226 Difference]: Without dead ends: 213 [2024-11-10 09:21:28,848 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:21:28,848 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 587 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-10 09:21:28,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 587 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:21:28,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-10 09:21:28,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2024-11-10 09:21:28,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 182 states have (on average 1.3406593406593406) internal successors, (244), 183 states have internal predecessors, (244), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-10 09:21:28,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 300 transitions. [2024-11-10 09:21:28,861 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 300 transitions. Word has length 135 [2024-11-10 09:21:28,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:28,862 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 300 transitions. [2024-11-10 09:21:28,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:21:28,862 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 300 transitions. [2024-11-10 09:21:28,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-10 09:21:28,864 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:28,864 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:28,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 09:21:28,865 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:28,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:28,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1178611753, now seen corresponding path program 1 times [2024-11-10 09:21:28,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:21:28,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361646984] [2024-11-10 09:21:28,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:28,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:21:28,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:28,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:21:28,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:28,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:21:28,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:29,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:21:29,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:29,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:21:29,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:29,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:21:29,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:29,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:21:29,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:29,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:21:29,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:29,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:21:29,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:29,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:21:29,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:29,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:21:29,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:29,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:21:29,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:29,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:21:29,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:29,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:21:29,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:29,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:21:29,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:29,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:21:29,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:29,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:21:29,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:29,045 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 09:21:29,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:21:29,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361646984] [2024-11-10 09:21:29,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361646984] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:29,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:29,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:21:29,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297307555] [2024-11-10 09:21:29,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:29,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:21:29,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:21:29,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:21:29,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:21:29,049 INFO L87 Difference]: Start difference. First operand 213 states and 300 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:21:29,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:29,191 INFO L93 Difference]: Finished difference Result 627 states and 879 transitions. [2024-11-10 09:21:29,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:21:29,191 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 137 [2024-11-10 09:21:29,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:29,195 INFO L225 Difference]: With dead ends: 627 [2024-11-10 09:21:29,195 INFO L226 Difference]: Without dead ends: 417 [2024-11-10 09:21:29,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:21:29,196 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 249 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:29,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 403 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:21:29,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2024-11-10 09:21:29,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 357. [2024-11-10 09:21:29,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 296 states have (on average 1.320945945945946) internal successors, (391), 298 states have internal predecessors, (391), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-10 09:21:29,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 503 transitions. [2024-11-10 09:21:29,217 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 503 transitions. Word has length 137 [2024-11-10 09:21:29,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:29,219 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 503 transitions. [2024-11-10 09:21:29,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:21:29,219 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 503 transitions. [2024-11-10 09:21:29,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-10 09:21:29,220 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:29,220 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:29,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 09:21:29,220 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:29,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:29,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1601626540, now seen corresponding path program 1 times [2024-11-10 09:21:29,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:21:29,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018949573] [2024-11-10 09:21:29,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:29,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:21:29,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:29,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:21:29,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:29,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:21:29,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:29,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:21:29,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:29,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:21:29,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:29,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:21:29,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:29,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:21:29,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:29,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:21:29,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:29,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:21:29,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:29,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:21:29,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:29,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:21:29,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:29,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:21:29,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:29,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:21:29,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:29,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:21:29,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:29,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:21:29,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:29,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:21:29,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:29,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:21:29,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:29,343 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 09:21:29,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:21:29,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018949573] [2024-11-10 09:21:29,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018949573] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:29,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:29,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:21:29,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658648695] [2024-11-10 09:21:29,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:29,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:21:29,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:21:29,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:21:29,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:21:29,345 INFO L87 Difference]: Start difference. First operand 357 states and 503 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:21:29,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:29,382 INFO L93 Difference]: Finished difference Result 680 states and 955 transitions. [2024-11-10 09:21:29,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:21:29,382 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 138 [2024-11-10 09:21:29,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:29,385 INFO L225 Difference]: With dead ends: 680 [2024-11-10 09:21:29,385 INFO L226 Difference]: Without dead ends: 362 [2024-11-10 09:21:29,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:21:29,386 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 63 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:29,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 438 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:21:29,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2024-11-10 09:21:29,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 359. [2024-11-10 09:21:29,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 298 states have (on average 1.3187919463087248) internal successors, (393), 300 states have internal predecessors, (393), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-10 09:21:29,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 505 transitions. [2024-11-10 09:21:29,400 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 505 transitions. Word has length 138 [2024-11-10 09:21:29,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:29,400 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 505 transitions. [2024-11-10 09:21:29,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:21:29,400 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 505 transitions. [2024-11-10 09:21:29,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-10 09:21:29,401 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:29,401 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:29,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 09:21:29,402 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:29,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:29,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1340031059, now seen corresponding path program 1 times [2024-11-10 09:21:29,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:21:29,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436490564] [2024-11-10 09:21:29,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:29,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:21:29,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:29,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:21:29,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:29,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:21:29,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:29,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:21:29,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:29,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:21:29,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:29,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:21:29,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:29,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:21:29,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:29,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:21:29,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:29,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:21:29,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:29,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:21:29,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:29,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:21:29,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:29,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:21:29,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:29,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:21:29,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:29,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:21:29,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:29,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:21:29,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:29,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:21:29,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:29,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:21:29,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:29,786 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 09:21:29,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:21:29,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436490564] [2024-11-10 09:21:29,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436490564] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:29,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:29,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 09:21:29,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066122563] [2024-11-10 09:21:29,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:29,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:21:29,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:21:29,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:21:29,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:21:29,789 INFO L87 Difference]: Start difference. First operand 359 states and 505 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:21:29,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:29,828 INFO L93 Difference]: Finished difference Result 691 states and 968 transitions. [2024-11-10 09:21:29,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:21:29,829 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 138 [2024-11-10 09:21:29,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:29,830 INFO L225 Difference]: With dead ends: 691 [2024-11-10 09:21:29,830 INFO L226 Difference]: Without dead ends: 371 [2024-11-10 09:21:29,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:21:29,831 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:29,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 729 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:21:29,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2024-11-10 09:21:29,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 362. [2024-11-10 09:21:29,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 301 states have (on average 1.3156146179401993) internal successors, (396), 303 states have internal predecessors, (396), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-10 09:21:29,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 508 transitions. [2024-11-10 09:21:29,845 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 508 transitions. Word has length 138 [2024-11-10 09:21:29,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:29,846 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 508 transitions. [2024-11-10 09:21:29,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:21:29,846 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 508 transitions. [2024-11-10 09:21:29,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-10 09:21:29,847 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:29,847 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:29,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 09:21:29,847 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:29,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:29,848 INFO L85 PathProgramCache]: Analyzing trace with hash -216972001, now seen corresponding path program 1 times [2024-11-10 09:21:29,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:21:29,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747581559] [2024-11-10 09:21:29,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:29,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:21:29,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:29,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:21:29,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:29,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:21:29,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:29,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:21:29,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:29,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:21:29,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:29,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:21:29,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:29,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:21:29,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:29,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:21:29,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:29,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:21:29,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:29,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:21:29,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:29,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:21:29,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:29,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:21:29,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:29,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:21:29,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:29,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:21:29,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:29,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:21:29,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:29,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:21:29,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:29,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:21:29,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:29,993 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 09:21:29,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:21:29,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747581559] [2024-11-10 09:21:29,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747581559] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:29,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:29,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:21:29,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50415731] [2024-11-10 09:21:29,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:29,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:21:29,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:21:29,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:21:29,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:21:29,995 INFO L87 Difference]: Start difference. First operand 362 states and 508 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:21:30,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:30,091 INFO L93 Difference]: Finished difference Result 703 states and 985 transitions. [2024-11-10 09:21:30,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:21:30,091 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 139 [2024-11-10 09:21:30,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:30,093 INFO L225 Difference]: With dead ends: 703 [2024-11-10 09:21:30,093 INFO L226 Difference]: Without dead ends: 380 [2024-11-10 09:21:30,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:21:30,094 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 138 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:30,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 729 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:21:30,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2024-11-10 09:21:30,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 368. [2024-11-10 09:21:30,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 302 states have (on average 1.294701986754967) internal successors, (391), 304 states have internal predecessors, (391), 60 states have call successors, (60), 5 states have call predecessors, (60), 5 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-10 09:21:30,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 511 transitions. [2024-11-10 09:21:30,113 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 511 transitions. Word has length 139 [2024-11-10 09:21:30,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:30,113 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 511 transitions. [2024-11-10 09:21:30,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:21:30,114 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 511 transitions. [2024-11-10 09:21:30,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-10 09:21:30,114 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:30,115 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:30,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 09:21:30,115 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:30,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:30,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1290579808, now seen corresponding path program 1 times [2024-11-10 09:21:30,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:21:30,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208741799] [2024-11-10 09:21:30,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:30,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:21:30,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:30,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:21:30,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:30,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:21:30,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:30,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:21:30,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:30,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:21:30,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:30,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:21:30,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:30,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:21:30,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:30,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:21:30,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:30,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:21:30,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:30,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:21:30,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:30,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:21:30,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:30,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:21:30,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:30,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:21:30,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:30,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:21:30,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:30,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:21:30,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:30,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:21:30,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:30,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:21:30,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:30,658 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 09:21:30,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:21:30,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208741799] [2024-11-10 09:21:30,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208741799] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:30,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:30,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 09:21:30,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825003813] [2024-11-10 09:21:30,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:30,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:21:30,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:21:30,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:21:30,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:21:30,660 INFO L87 Difference]: Start difference. First operand 368 states and 511 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:21:30,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:30,727 INFO L93 Difference]: Finished difference Result 392 states and 534 transitions. [2024-11-10 09:21:30,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:21:30,728 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 139 [2024-11-10 09:21:30,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:30,730 INFO L225 Difference]: With dead ends: 392 [2024-11-10 09:21:30,730 INFO L226 Difference]: Without dead ends: 389 [2024-11-10 09:21:30,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 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-10 09:21:30,732 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 94 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:30,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 878 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:21:30,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2024-11-10 09:21:30,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 389. [2024-11-10 09:21:30,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 320 states have (on average 1.278125) internal successors, (409), 322 states have internal predecessors, (409), 60 states have call successors, (60), 8 states have call predecessors, (60), 8 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-10 09:21:30,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 529 transitions. [2024-11-10 09:21:30,757 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 529 transitions. Word has length 139 [2024-11-10 09:21:30,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:30,758 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 529 transitions. [2024-11-10 09:21:30,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:21:30,758 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 529 transitions. [2024-11-10 09:21:30,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-10 09:21:30,760 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:30,760 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:30,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 09:21:30,760 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:30,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:30,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1319208959, now seen corresponding path program 1 times [2024-11-10 09:21:30,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:21:30,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377284390] [2024-11-10 09:21:30,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:30,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:21:30,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 09:21:30,849 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 09:21:30,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 09:21:30,979 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 09:21:30,979 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 09:21:30,980 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 09:21:30,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 09:21:30,983 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:31,052 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 09:21:31,054 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 09:21:31 BoogieIcfgContainer [2024-11-10 09:21:31,054 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 09:21:31,055 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 09:21:31,055 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 09:21:31,055 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 09:21:31,055 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:21:25" (3/4) ... [2024-11-10 09:21:31,057 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 09:21:31,058 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 09:21:31,058 INFO L158 Benchmark]: Toolchain (without parser) took 6378.79ms. Allocated memory was 138.4MB in the beginning and 465.6MB in the end (delta: 327.2MB). Free memory was 69.1MB in the beginning and 215.7MB in the end (delta: -146.7MB). Peak memory consumption was 183.4MB. Max. memory is 16.1GB. [2024-11-10 09:21:31,058 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 138.4MB. Free memory is still 102.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 09:21:31,059 INFO L158 Benchmark]: CACSL2BoogieTranslator took 371.74ms. Allocated memory was 138.4MB in the beginning and 237.0MB in the end (delta: 98.6MB). Free memory was 68.9MB in the beginning and 198.5MB in the end (delta: -129.6MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. [2024-11-10 09:21:31,059 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.45ms. Allocated memory is still 237.0MB. Free memory was 198.5MB in the beginning and 194.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 09:21:31,059 INFO L158 Benchmark]: Boogie Preprocessor took 79.50ms. Allocated memory is still 237.0MB. Free memory was 194.3MB in the beginning and 189.1MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 09:21:31,059 INFO L158 Benchmark]: IcfgBuilder took 626.29ms. Allocated memory is still 237.0MB. Free memory was 189.1MB in the beginning and 151.3MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-11-10 09:21:31,059 INFO L158 Benchmark]: TraceAbstraction took 5242.82ms. Allocated memory was 237.0MB in the beginning and 465.6MB in the end (delta: 228.6MB). Free memory was 150.3MB in the beginning and 216.8MB in the end (delta: -66.5MB). Peak memory consumption was 162.1MB. Max. memory is 16.1GB. [2024-11-10 09:21:31,060 INFO L158 Benchmark]: Witness Printer took 3.36ms. Allocated memory is still 465.6MB. Free memory was 216.8MB in the beginning and 215.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 09:21:31,061 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.15ms. Allocated memory is still 138.4MB. Free memory is still 102.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 371.74ms. Allocated memory was 138.4MB in the beginning and 237.0MB in the end (delta: 98.6MB). Free memory was 68.9MB in the beginning and 198.5MB in the end (delta: -129.6MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.45ms. Allocated memory is still 237.0MB. Free memory was 198.5MB in the beginning and 194.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 79.50ms. Allocated memory is still 237.0MB. Free memory was 194.3MB in the beginning and 189.1MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * IcfgBuilder took 626.29ms. Allocated memory is still 237.0MB. Free memory was 189.1MB in the beginning and 151.3MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 5242.82ms. Allocated memory was 237.0MB in the beginning and 465.6MB in the end (delta: 228.6MB). Free memory was 150.3MB in the beginning and 216.8MB in the end (delta: -66.5MB). Peak memory consumption was 162.1MB. Max. memory is 16.1GB. * Witness Printer took 3.36ms. Allocated memory is still 465.6MB. Free memory was 216.8MB in the beginning and 215.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 someBinaryDOUBLEComparisonOperation at line 86, overapproximation of someBinaryFLOATComparisonOperation at line 101. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 0, 0, 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 0, 0, 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 0, 0, 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 0, 0, 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 0, 0, 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 0, 0, 1, 0 }; [L25-L27] double double_Array_0[3] = { 2.75, 4.575, 128.5 }; [L25-L27] double double_Array_0[3] = { 2.75, 4.575, 128.5 }; [L25-L27] double double_Array_0[3] = { 2.75, 4.575, 128.5 }; [L25-L27] double double_Array_0[3] = { 2.75, 4.575, 128.5 }; [L28-L30] float float_Array_0[1] = { 99999.25 }; [L28-L30] float float_Array_0[1] = { 99999.25 }; [L31-L33] signed char signed_char_Array_0[2] = { 1, 50 }; [L31-L33] signed char signed_char_Array_0[2] = { 1, 50 }; [L31-L33] signed char signed_char_Array_0[2] = { 1, 50 }; [L34-L36] signed long int signed_long_int_Array_0[1] = { -1000000000 }; [L34-L36] signed long int signed_long_int_Array_0[1] = { -1000000000 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[3] = { 1000, 8, 8 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[3] = { 1000, 8, 8 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[3] = { 1000, 8, 8 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[3] = { 1000, 8, 8 }; [L40] unsigned char last_1_BOOL_unsigned_char_Array_0_3_ = 1; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=0, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L105] isInitial = 1 [L106] FCALL initially() [L107] COND TRUE 1 [L108] CALL updateLastVariables() [L98] EXPR BOOL_unsigned_char_Array_0[3] [L98] last_1_BOOL_unsigned_char_Array_0_3_ = BOOL_unsigned_char_Array_0[3] [L108] RET updateLastVariables() [L109] CALL updateVariables() [L71] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L72] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L72] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L72] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L73] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L73] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L73] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L75] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L75] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L75] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] BOOL_unsigned_char_Array_0[2] = __VERIFIER_nondet_uchar() [L78] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[2] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[2] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] BOOL_unsigned_char_Array_0[4] = __VERIFIER_nondet_uchar() [L81] EXPR BOOL_unsigned_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[4] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[4] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] EXPR BOOL_unsigned_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[4] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[4] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] double_Array_0[0] = __VERIFIER_nondet_double() [L84] EXPR double_Array_0[0] [L84] EXPR double_Array_0[0] >= -461168.6018427382800e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] EXPR double_Array_0[0] >= -461168.6018427382800e+13F && double_Array_0[0] <= -1.0e-20F [L84] EXPR double_Array_0[0] [L84] EXPR double_Array_0[0] >= -461168.6018427382800e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] EXPR (double_Array_0[0] >= -461168.6018427382800e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 4611686.018427382800e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] EXPR (double_Array_0[0] >= -461168.6018427382800e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 4611686.018427382800e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] CALL assume_abort_if_not((double_Array_0[0] >= -461168.6018427382800e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 4611686.018427382800e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] RET assume_abort_if_not((double_Array_0[0] >= -461168.6018427382800e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 4611686.018427382800e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L85] double_Array_0[2] = __VERIFIER_nondet_double() [L86] EXPR double_Array_0[2] [L86] EXPR double_Array_0[2] >= -461168.6018427382800e+13F && double_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] EXPR double_Array_0[2] >= -461168.6018427382800e+13F && double_Array_0[2] <= -1.0e-20F [L86] EXPR double_Array_0[2] [L86] EXPR double_Array_0[2] >= -461168.6018427382800e+13F && double_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] EXPR (double_Array_0[2] >= -461168.6018427382800e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 4611686.018427382800e+12F && double_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] EXPR (double_Array_0[2] >= -461168.6018427382800e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 4611686.018427382800e+12F && double_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] CALL assume_abort_if_not((double_Array_0[2] >= -461168.6018427382800e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 4611686.018427382800e+12F && double_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] RET assume_abort_if_not((double_Array_0[2] >= -461168.6018427382800e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 4611686.018427382800e+12F && double_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L87] signed_char_Array_0[1] = __VERIFIER_nondet_char() [L88] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L88] CALL assume_abort_if_not(signed_char_Array_0[1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L88] RET assume_abort_if_not(signed_char_Array_0[1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] CALL assume_abort_if_not(signed_char_Array_0[1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] RET assume_abort_if_not(signed_char_Array_0[1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L90] unsigned_short_int_Array_0[0] = __VERIFIER_nondet_ushort() [L91] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L91] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L91] RET assume_abort_if_not(unsigned_short_int_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] RET assume_abort_if_not(unsigned_short_int_Array_0[0] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L93] unsigned_short_int_Array_0[1] = __VERIFIER_nondet_ushort() [L94] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L94] CALL assume_abort_if_not(unsigned_short_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L94] RET assume_abort_if_not(unsigned_short_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] CALL assume_abort_if_not(unsigned_short_int_Array_0[1] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] RET assume_abort_if_not(unsigned_short_int_Array_0[1] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L109] RET updateVariables() [L110] CALL step() [L44] COND FALSE !(! last_1_BOOL_unsigned_char_Array_0_3_) [L47] EXPR unsigned_short_int_Array_0[0] [L47] unsigned_short_int_Array_0[2] = unsigned_short_int_Array_0[0] [L49] EXPR BOOL_unsigned_char_Array_0[2] [L49] unsigned char stepLocal_0 = BOOL_unsigned_char_Array_0[2]; [L50] BOOL_unsigned_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L50] COND FALSE !(BOOL_unsigned_char_Array_0[4]) [L59] EXPR unsigned_short_int_Array_0[2] [L59] signed_long_int_Array_0[0] = unsigned_short_int_Array_0[2] [L60] EXPR double_Array_0[0] [L60] float_Array_0[0] = double_Array_0[0] [L61] EXPR signed_char_Array_0[1] [L61] signed_char_Array_0[0] = signed_char_Array_0[1] [L62] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L62] EXPR ((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]) [L62] EXPR signed_long_int_Array_0[0] [L62] EXPR ((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, stepLocal_0=257, unsigned_short_int_Array_0={9:0}] [L62] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L62] COND FALSE !(((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) > signed_long_int_Array_0[0]) [L110] RET step() [L111] CALL, EXPR property() [L101] EXPR (! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0])) [L101] EXPR unsigned_short_int_Array_0[2] [L101] EXPR unsigned_short_int_Array_0[0] [L101] EXPR (! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR ((! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))) && (BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR ((! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))) && (BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1) [L101] EXPR BOOL_unsigned_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1 [L101] EXPR BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR ((! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))) && (BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR (((! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))) && (BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1)) && ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) > signed_long_int_Array_0[0]) ? (((signed_long_int_Array_0[0] / -5) >= ((unsigned_short_int_Array_0[0] + signed_long_int_Array_0[0]) - ((((unsigned_short_int_Array_0[2]) < (unsigned_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2]) : (unsigned_short_int_Array_0[1]))))) ? (double_Array_0[1] == ((double) (double_Array_0[0] + double_Array_0[2]))) : (double_Array_0[1] == ((double) double_Array_0[2]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR (((! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))) && (BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1)) && ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) > signed_long_int_Array_0[0]) ? (((signed_long_int_Array_0[0] / -5) >= ((unsigned_short_int_Array_0[0] + signed_long_int_Array_0[0]) - ((((unsigned_short_int_Array_0[2]) < (unsigned_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2]) : (unsigned_short_int_Array_0[1]))))) ? (double_Array_0[1] == ((double) (double_Array_0[0] + double_Array_0[2]))) : (double_Array_0[1] == ((double) double_Array_0[2]))) : 1) [L101] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR ((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]) [L101] EXPR signed_long_int_Array_0[0] [L101] EXPR ((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR (((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) > signed_long_int_Array_0[0]) ? (((signed_long_int_Array_0[0] / -5) >= ((unsigned_short_int_Array_0[0] + signed_long_int_Array_0[0]) - ((((unsigned_short_int_Array_0[2]) < (unsigned_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2]) : (unsigned_short_int_Array_0[1]))))) ? (double_Array_0[1] == ((double) (double_Array_0[0] + double_Array_0[2]))) : (double_Array_0[1] == ((double) double_Array_0[2]))) : 1 [L101] EXPR (((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) > signed_long_int_Array_0[0]) ? (((signed_long_int_Array_0[0] / -5) >= ((unsigned_short_int_Array_0[0] + signed_long_int_Array_0[0]) - ((((unsigned_short_int_Array_0[2]) < (unsigned_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2]) : (unsigned_short_int_Array_0[1]))))) ? (double_Array_0[1] == ((double) (double_Array_0[0] + double_Array_0[2]))) : (double_Array_0[1] == ((double) double_Array_0[2]))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR (((! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))) && (BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1)) && ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) > signed_long_int_Array_0[0]) ? (((signed_long_int_Array_0[0] / -5) >= ((unsigned_short_int_Array_0[0] + signed_long_int_Array_0[0]) - ((((unsigned_short_int_Array_0[2]) < (unsigned_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2]) : (unsigned_short_int_Array_0[1]))))) ? (double_Array_0[1] == ((double) (double_Array_0[0] + double_Array_0[2]))) : (double_Array_0[1] == ((double) double_Array_0[2]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR ((((! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))) && (BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1)) && ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) > signed_long_int_Array_0[0]) ? (((signed_long_int_Array_0[0] / -5) >= ((unsigned_short_int_Array_0[0] + signed_long_int_Array_0[0]) - ((((unsigned_short_int_Array_0[2]) < (unsigned_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2]) : (unsigned_short_int_Array_0[1]))))) ? (double_Array_0[1] == ((double) (double_Array_0[0] + double_Array_0[2]))) : (double_Array_0[1] == ((double) double_Array_0[2]))) : 1)) && (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[2])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR ((((! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))) && (BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1)) && ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) > signed_long_int_Array_0[0]) ? (((signed_long_int_Array_0[0] / -5) >= ((unsigned_short_int_Array_0[0] + signed_long_int_Array_0[0]) - ((((unsigned_short_int_Array_0[2]) < (unsigned_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2]) : (unsigned_short_int_Array_0[1]))))) ? (double_Array_0[1] == ((double) (double_Array_0[0] + double_Array_0[2]))) : (double_Array_0[1] == ((double) double_Array_0[2]))) : 1)) && (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[2])) [L101] EXPR signed_long_int_Array_0[0] [L101] EXPR unsigned_short_int_Array_0[2] [L101] EXPR ((((! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))) && (BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1)) && ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) > signed_long_int_Array_0[0]) ? (((signed_long_int_Array_0[0] / -5) >= ((unsigned_short_int_Array_0[0] + signed_long_int_Array_0[0]) - ((((unsigned_short_int_Array_0[2]) < (unsigned_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2]) : (unsigned_short_int_Array_0[1]))))) ? (double_Array_0[1] == ((double) (double_Array_0[0] + double_Array_0[2]))) : (double_Array_0[1] == ((double) double_Array_0[2]))) : 1)) && (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[2])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR (((((! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))) && (BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1)) && ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) > signed_long_int_Array_0[0]) ? (((signed_long_int_Array_0[0] / -5) >= ((unsigned_short_int_Array_0[0] + signed_long_int_Array_0[0]) - ((((unsigned_short_int_Array_0[2]) < (unsigned_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2]) : (unsigned_short_int_Array_0[1]))))) ? (double_Array_0[1] == ((double) (double_Array_0[0] + double_Array_0[2]))) : (double_Array_0[1] == ((double) double_Array_0[2]))) : 1)) && (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[2]))) && (float_Array_0[0] == ((float) double_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR (((((! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))) && (BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1)) && ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) > signed_long_int_Array_0[0]) ? (((signed_long_int_Array_0[0] / -5) >= ((unsigned_short_int_Array_0[0] + signed_long_int_Array_0[0]) - ((((unsigned_short_int_Array_0[2]) < (unsigned_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2]) : (unsigned_short_int_Array_0[1]))))) ? (double_Array_0[1] == ((double) (double_Array_0[0] + double_Array_0[2]))) : (double_Array_0[1] == ((double) double_Array_0[2]))) : 1)) && (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[2]))) && (float_Array_0[0] == ((float) double_Array_0[0])) [L101] EXPR float_Array_0[0] [L101] EXPR double_Array_0[0] [L101] EXPR (((((! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))) && (BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1)) && ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) > signed_long_int_Array_0[0]) ? (((signed_long_int_Array_0[0] / -5) >= ((unsigned_short_int_Array_0[0] + signed_long_int_Array_0[0]) - ((((unsigned_short_int_Array_0[2]) < (unsigned_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2]) : (unsigned_short_int_Array_0[1]))))) ? (double_Array_0[1] == ((double) (double_Array_0[0] + double_Array_0[2]))) : (double_Array_0[1] == ((double) double_Array_0[2]))) : 1)) && (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[2]))) && (float_Array_0[0] == ((float) double_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR ((((((! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))) && (BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1)) && ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) > signed_long_int_Array_0[0]) ? (((signed_long_int_Array_0[0] / -5) >= ((unsigned_short_int_Array_0[0] + signed_long_int_Array_0[0]) - ((((unsigned_short_int_Array_0[2]) < (unsigned_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2]) : (unsigned_short_int_Array_0[1]))))) ? (double_Array_0[1] == ((double) (double_Array_0[0] + double_Array_0[2]))) : (double_Array_0[1] == ((double) double_Array_0[2]))) : 1)) && (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[2]))) && (float_Array_0[0] == ((float) double_Array_0[0]))) && (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR ((((((! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))) && (BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1)) && ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) > signed_long_int_Array_0[0]) ? (((signed_long_int_Array_0[0] / -5) >= ((unsigned_short_int_Array_0[0] + signed_long_int_Array_0[0]) - ((((unsigned_short_int_Array_0[2]) < (unsigned_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2]) : (unsigned_short_int_Array_0[1]))))) ? (double_Array_0[1] == ((double) (double_Array_0[0] + double_Array_0[2]))) : (double_Array_0[1] == ((double) double_Array_0[2]))) : 1)) && (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[2]))) && (float_Array_0[0] == ((float) double_Array_0[0]))) && (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101-L102] return ((((((! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))) && (BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1)) && ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) > signed_long_int_Array_0[0]) ? (((signed_long_int_Array_0[0] / -5) >= ((unsigned_short_int_Array_0[0] + signed_long_int_Array_0[0]) - ((((unsigned_short_int_Array_0[2]) < (unsigned_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2]) : (unsigned_short_int_Array_0[1]))))) ? (double_Array_0[1] == ((double) (double_Array_0[0] + double_Array_0[2]))) : (double_Array_0[1] == ((double) double_Array_0[2]))) : 1)) && (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[2]))) && (float_Array_0[0] == ((float) double_Array_0[0]))) && (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1])) ; [L111] RET, EXPR property() [L111] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 111 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.1s, OverallIterations: 15, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 810 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 809 mSDsluCounter, 7410 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5078 mSDsCounter, 62 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 506 IncrementalHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 62 mSolverCounterUnsat, 2332 mSDtfsCounter, 506 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 542 GetRequests, 499 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=389occurred in iteration=14, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 137 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 2033 NumberOfCodeBlocks, 2033 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1880 ConstructedInterpolants, 0 QuantifiedInterpolants, 2597 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 6720/6720 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 09:21:31,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-96.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 fdbb2557d13c4ebf5afc59b31f2554eb4dac84eb5f5361696929e0578cc40049 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 09:21:33,225 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 09:21:33,293 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 09:21:33,297 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 09:21:33,298 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 09:21:33,321 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 09:21:33,322 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 09:21:33,322 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 09:21:33,323 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 09:21:33,325 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 09:21:33,325 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 09:21:33,326 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 09:21:33,326 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 09:21:33,326 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 09:21:33,326 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 09:21:33,327 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 09:21:33,327 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 09:21:33,327 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 09:21:33,328 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 09:21:33,328 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 09:21:33,328 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 09:21:33,329 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 09:21:33,329 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 09:21:33,329 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 09:21:33,329 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 09:21:33,330 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 09:21:33,330 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 09:21:33,331 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 09:21:33,331 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 09:21:33,331 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 09:21:33,331 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 09:21:33,331 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 09:21:33,331 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 09:21:33,332 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 09:21:33,332 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:21:33,332 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 09:21:33,333 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 09:21:33,333 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 09:21:33,333 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 09:21:33,334 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 09:21:33,334 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 09:21:33,334 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 09:21:33,334 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 09:21:33,334 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 09:21:33,334 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 -> fdbb2557d13c4ebf5afc59b31f2554eb4dac84eb5f5361696929e0578cc40049 [2024-11-10 09:21:33,610 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 09:21:33,631 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 09:21:33,633 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 09:21:33,635 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 09:21:33,635 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 09:21:33,636 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-96.i [2024-11-10 09:21:35,067 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 09:21:35,273 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 09:21:35,274 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-96.i [2024-11-10 09:21:35,284 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1fa1f34c/693da430e72348f2b9e6c6380bd29358/FLAG445085c63 [2024-11-10 09:21:35,297 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1fa1f34c/693da430e72348f2b9e6c6380bd29358 [2024-11-10 09:21:35,299 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 09:21:35,301 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 09:21:35,302 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 09:21:35,303 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 09:21:35,307 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 09:21:35,307 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:21:35" (1/1) ... [2024-11-10 09:21:35,308 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@758c5934 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:35, skipping insertion in model container [2024-11-10 09:21:35,308 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:21:35" (1/1) ... [2024-11-10 09:21:35,328 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 09:21:35,494 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-96.i[916,929] [2024-11-10 09:21:35,559 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:21:35,580 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 09:21:35,591 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-96.i[916,929] [2024-11-10 09:21:35,622 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:21:35,646 INFO L204 MainTranslator]: Completed translation [2024-11-10 09:21:35,647 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:35 WrapperNode [2024-11-10 09:21:35,647 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 09:21:35,648 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 09:21:35,648 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 09:21:35,648 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 09:21:35,654 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:35" (1/1) ... [2024-11-10 09:21:35,676 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:35" (1/1) ... [2024-11-10 09:21:35,726 INFO L138 Inliner]: procedures = 39, calls = 160, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 485 [2024-11-10 09:21:35,727 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 09:21:35,727 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 09:21:35,727 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 09:21:35,728 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 09:21:35,739 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:35" (1/1) ... [2024-11-10 09:21:35,740 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:35" (1/1) ... [2024-11-10 09:21:35,753 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:35" (1/1) ... [2024-11-10 09:21:35,790 INFO L175 MemorySlicer]: Split 127 memory accesses to 7 slices as follows [2, 32, 25, 3, 9, 15, 41]. 32 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 5, 3, 1, 2, 1, 3]. The 18 writes are split as follows [0, 6, 4, 1, 2, 1, 4]. [2024-11-10 09:21:35,790 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:35" (1/1) ... [2024-11-10 09:21:35,790 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:35" (1/1) ... [2024-11-10 09:21:35,827 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:35" (1/1) ... [2024-11-10 09:21:35,832 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:35" (1/1) ... [2024-11-10 09:21:35,836 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:35" (1/1) ... [2024-11-10 09:21:35,845 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:35" (1/1) ... [2024-11-10 09:21:35,856 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 09:21:35,857 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 09:21:35,859 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 09:21:35,860 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 09:21:35,860 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:35" (1/1) ... [2024-11-10 09:21:35,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:21:35,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:21:35,892 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 09:21:35,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 09:21:35,942 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 09:21:35,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-10 09:21:35,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-10 09:21:35,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-10 09:21:35,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-10 09:21:35,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-10 09:21:35,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-11-10 09:21:35,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2024-11-10 09:21:35,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-10 09:21:35,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-10 09:21:35,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-10 09:21:35,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-10 09:21:35,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-10 09:21:35,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-11-10 09:21:35,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2024-11-10 09:21:35,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-10 09:21:35,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-10 09:21:35,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-10 09:21:35,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-10 09:21:35,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-10 09:21:35,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-10 09:21:35,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-11-10 09:21:35,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-10 09:21:35,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-10 09:21:35,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-10 09:21:35,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-10 09:21:35,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-10 09:21:35,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-10 09:21:35,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-11-10 09:21:35,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 09:21:35,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-10 09:21:35,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-10 09:21:35,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-10 09:21:35,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-10 09:21:35,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-10 09:21:35,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-10 09:21:35,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-10 09:21:35,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-10 09:21:35,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-10 09:21:35,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-10 09:21:35,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-10 09:21:35,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-10 09:21:35,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-11-10 09:21:35,958 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-10 09:21:35,958 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-10 09:21:35,958 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-10 09:21:35,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-10 09:21:35,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-10 09:21:35,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-10 09:21:35,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-11-10 09:21:35,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-10 09:21:35,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-10 09:21:35,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-10 09:21:35,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-10 09:21:35,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-10 09:21:35,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-11-10 09:21:35,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2024-11-10 09:21:35,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-10 09:21:35,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-10 09:21:35,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-10 09:21:35,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-10 09:21:35,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-10 09:21:35,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-10 09:21:35,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-11-10 09:21:35,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-10 09:21:35,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-10 09:21:35,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-10 09:21:35,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-10 09:21:35,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-10 09:21:35,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-11-10 09:21:35,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-11-10 09:21:35,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-10 09:21:35,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-10 09:21:35,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-10 09:21:35,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-10 09:21:35,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-10 09:21:35,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-10 09:21:35,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-11-10 09:21:35,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-10 09:21:35,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-10 09:21:35,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-10 09:21:35,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-10 09:21:35,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-10 09:21:35,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-11-10 09:21:35,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-11-10 09:21:35,965 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 09:21:35,965 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 09:21:35,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 09:21:35,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 09:21:35,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-10 09:21:35,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-10 09:21:35,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-10 09:21:35,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-10 09:21:35,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-10 09:21:35,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-10 09:21:35,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-11-10 09:21:35,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-10 09:21:35,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-10 09:21:35,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-10 09:21:35,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-10 09:21:35,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-10 09:21:35,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-11-10 09:21:35,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-11-10 09:21:35,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-10 09:21:35,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-10 09:21:35,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-10 09:21:35,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-10 09:21:35,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-10 09:21:35,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-10 09:21:35,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-11-10 09:21:36,173 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 09:21:36,175 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 09:21:37,104 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L101: havoc property_#t~ite85#1;havoc property_#t~mem82#1;havoc property_#t~mem77#1;havoc property_#t~mem78#1;havoc property_#t~ite81#1;havoc property_#t~mem79#1;havoc property_#t~mem80#1;havoc property_#t~mem84#1;havoc property_#t~mem83#1;havoc property_#t~mem86#1;havoc property_#t~ite100#1;havoc property_#t~mem88#1;havoc property_#t~mem87#1;havoc property_#t~short89#1;havoc property_#t~ite99#1;havoc property_#t~mem90#1;havoc property_#t~ite98#1;havoc property_#t~mem95#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~short94#1;havoc property_#t~mem97#1;havoc property_#t~mem96#1;havoc property_#t~short101#1;havoc property_#t~mem102#1;havoc property_#t~ite105#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~mem106#1;havoc property_#t~ite121#1;havoc property_#t~mem107#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~ite114#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~ite120#1;havoc property_#t~mem117#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~mem119#1;havoc property_#t~mem118#1;havoc property_#t~short122#1;havoc property_#t~mem124#1;havoc property_#t~mem123#1;havoc property_#t~short125#1;havoc property_#t~mem127#1;havoc property_#t~mem126#1;havoc property_#t~short128#1;havoc property_#t~mem130#1;havoc property_#t~mem129#1;havoc property_#t~short131#1; [2024-11-10 09:21:37,147 INFO L? ?]: Removed 113 outVars from TransFormulas that were not future-live. [2024-11-10 09:21:37,147 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 09:21:37,161 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 09:21:37,162 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 09:21:37,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:21:37 BoogieIcfgContainer [2024-11-10 09:21:37,163 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 09:21:37,165 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 09:21:37,165 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 09:21:37,168 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 09:21:37,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:21:35" (1/3) ... [2024-11-10 09:21:37,169 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bbb4cfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:21:37, skipping insertion in model container [2024-11-10 09:21:37,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:35" (2/3) ... [2024-11-10 09:21:37,169 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bbb4cfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:21:37, skipping insertion in model container [2024-11-10 09:21:37,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:21:37" (3/3) ... [2024-11-10 09:21:37,172 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-96.i [2024-11-10 09:21:37,189 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 09:21:37,189 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 09:21:37,256 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 09:21:37,261 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;@48d373ca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 09:21:37,261 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 09:21:37,265 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 92 states have (on average 1.4130434782608696) internal successors, (130), 93 states have internal predecessors, (130), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 09:21:37,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-10 09:21:37,275 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:37,276 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:37,276 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:37,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:37,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1860286907, now seen corresponding path program 1 times [2024-11-10 09:21:37,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:21:37,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [38257845] [2024-11-10 09:21:37,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:37,292 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:21:37,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:21:37,298 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 09:21:37,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 09:21:37,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:37,637 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 09:21:37,652 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:21:37,696 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2024-11-10 09:21:37,697 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:21:37,697 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:21:37,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [38257845] [2024-11-10 09:21:37,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [38257845] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:37,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:37,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 09:21:37,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732072798] [2024-11-10 09:21:37,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:37,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 09:21:37,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:21:37,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 09:21:37,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:21:37,739 INFO L87 Difference]: Start difference. First operand has 111 states, 92 states have (on average 1.4130434782608696) internal successors, (130), 93 states have internal predecessors, (130), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 09:21:37,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:37,783 INFO L93 Difference]: Finished difference Result 214 states and 333 transitions. [2024-11-10 09:21:37,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 09:21:37,789 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 133 [2024-11-10 09:21:37,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:37,800 INFO L225 Difference]: With dead ends: 214 [2024-11-10 09:21:37,800 INFO L226 Difference]: Without dead ends: 106 [2024-11-10 09:21:37,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:21:37,806 INFO L432 NwaCegarLoop]: 154 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, 154 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:37,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:21:37,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-10 09:21:37,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-10 09:21:37,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 88 states have (on average 1.3863636363636365) internal successors, (122), 88 states have internal predecessors, (122), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 09:21:37,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 154 transitions. [2024-11-10 09:21:37,871 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 154 transitions. Word has length 133 [2024-11-10 09:21:37,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:37,872 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 154 transitions. [2024-11-10 09:21:37,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 09:21:37,872 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 154 transitions. [2024-11-10 09:21:37,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-10 09:21:37,875 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:37,875 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:37,887 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-10 09:21:38,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:21:38,078 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:38,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:38,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1366927273, now seen corresponding path program 1 times [2024-11-10 09:21:38,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:21:38,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1527847419] [2024-11-10 09:21:38,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:38,081 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:21:38,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:21:38,084 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 09:21:38,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 09:21:38,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:38,420 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 09:21:38,426 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:21:38,517 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 11 treesize of output 5 [2024-11-10 09:21:38,535 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 09:21:38,536 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:21:38,536 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:21:38,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1527847419] [2024-11-10 09:21:38,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1527847419] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:38,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:38,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 09:21:38,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606123586] [2024-11-10 09:21:38,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:38,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 09:21:38,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:21:38,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 09:21:38,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 09:21:38,539 INFO L87 Difference]: Start difference. First operand 106 states and 154 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:21:38,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:38,571 INFO L93 Difference]: Finished difference Result 209 states and 305 transitions. [2024-11-10 09:21:38,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 09:21:38,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2024-11-10 09:21:38,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:38,574 INFO L225 Difference]: With dead ends: 209 [2024-11-10 09:21:38,574 INFO L226 Difference]: Without dead ends: 106 [2024-11-10 09:21:38,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 09:21:38,576 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:38,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 299 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:21:38,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-10 09:21:38,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-10 09:21:38,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 88 states have (on average 1.375) internal successors, (121), 88 states have internal predecessors, (121), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 09:21:38,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 153 transitions. [2024-11-10 09:21:38,586 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 153 transitions. Word has length 133 [2024-11-10 09:21:38,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:38,588 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 153 transitions. [2024-11-10 09:21:38,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:21:38,589 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 153 transitions. [2024-11-10 09:21:38,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-10 09:21:38,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:38,591 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:38,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-10 09:21:38,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:21:38,792 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:38,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:38,792 INFO L85 PathProgramCache]: Analyzing trace with hash 958103048, now seen corresponding path program 1 times [2024-11-10 09:21:38,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:21:38,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [509797045] [2024-11-10 09:21:38,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:38,793 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:21:38,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:21:38,806 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 09:21:38,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 09:21:39,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:39,178 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 09:21:39,182 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:21:39,214 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 09:21:39,214 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:21:39,215 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:21:39,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [509797045] [2024-11-10 09:21:39,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [509797045] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:39,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:39,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:21:39,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340353920] [2024-11-10 09:21:39,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:39,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:21:39,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:21:39,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:21:39,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:21:39,217 INFO L87 Difference]: Start difference. First operand 106 states and 153 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:21:39,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:39,258 INFO L93 Difference]: Finished difference Result 214 states and 310 transitions. [2024-11-10 09:21:39,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:21:39,259 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2024-11-10 09:21:39,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:39,260 INFO L225 Difference]: With dead ends: 214 [2024-11-10 09:21:39,260 INFO L226 Difference]: Without dead ends: 111 [2024-11-10 09:21:39,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:21:39,265 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 1 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:39,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 576 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:21:39,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-10 09:21:39,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2024-11-10 09:21:39,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 92 states have (on average 1.358695652173913) internal successors, (125), 92 states have internal predecessors, (125), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 09:21:39,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 157 transitions. [2024-11-10 09:21:39,276 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 157 transitions. Word has length 133 [2024-11-10 09:21:39,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:39,279 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 157 transitions. [2024-11-10 09:21:39,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:21:39,280 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 157 transitions. [2024-11-10 09:21:39,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-10 09:21:39,281 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:39,281 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:39,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-10 09:21:39,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:21:39,482 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:39,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:39,485 INFO L85 PathProgramCache]: Analyzing trace with hash 761589543, now seen corresponding path program 1 times [2024-11-10 09:21:39,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:21:39,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [156048888] [2024-11-10 09:21:39,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:39,486 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:21:39,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:21:39,487 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 09:21:39,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-10 09:21:39,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:39,785 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 09:21:39,788 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:21:39,819 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 09:21:39,820 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:21:39,820 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:21:39,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [156048888] [2024-11-10 09:21:39,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [156048888] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:39,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:39,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 09:21:39,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841323299] [2024-11-10 09:21:39,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:39,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:21:39,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:21:39,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:21:39,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:21:39,821 INFO L87 Difference]: Start difference. First operand 110 states and 157 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:21:40,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:40,041 INFO L93 Difference]: Finished difference Result 220 states and 315 transitions. [2024-11-10 09:21:40,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:21:40,041 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2024-11-10 09:21:40,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:40,042 INFO L225 Difference]: With dead ends: 220 [2024-11-10 09:21:40,043 INFO L226 Difference]: Without dead ends: 113 [2024-11-10 09:21:40,043 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:21:40,044 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 1 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 710 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.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:40,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 710 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:21:40,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-10 09:21:40,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2024-11-10 09:21:40,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 94 states have (on average 1.351063829787234) internal successors, (127), 94 states have internal predecessors, (127), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 09:21:40,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 159 transitions. [2024-11-10 09:21:40,054 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 159 transitions. Word has length 133 [2024-11-10 09:21:40,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:40,054 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 159 transitions. [2024-11-10 09:21:40,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:21:40,054 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 159 transitions. [2024-11-10 09:21:40,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-10 09:21:40,055 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:40,055 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:40,064 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-10 09:21:40,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:21:40,256 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:40,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:40,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1790567418, now seen corresponding path program 1 times [2024-11-10 09:21:40,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:21:40,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [388262399] [2024-11-10 09:21:40,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:40,258 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:21:40,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:21:40,263 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 09:21:40,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-10 09:21:40,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:40,482 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 09:21:40,486 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:21:40,527 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 09:21:40,528 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:21:40,528 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:21:40,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [388262399] [2024-11-10 09:21:40,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [388262399] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:40,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:40,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 09:21:40,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074712418] [2024-11-10 09:21:40,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:40,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 09:21:40,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:21:40,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 09:21:40,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:21:40,530 INFO L87 Difference]: Start difference. First operand 112 states and 159 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:21:40,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:40,751 INFO L93 Difference]: Finished difference Result 224 states and 319 transitions. [2024-11-10 09:21:40,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 09:21:40,755 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2024-11-10 09:21:40,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:40,756 INFO L225 Difference]: With dead ends: 224 [2024-11-10 09:21:40,756 INFO L226 Difference]: Without dead ends: 115 [2024-11-10 09:21:40,757 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 127 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-10 09:21:40,757 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 1 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 845 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.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:40,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 845 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:21:40,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-10 09:21:40,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2024-11-10 09:21:40,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 96 states have (on average 1.34375) internal successors, (129), 96 states have internal predecessors, (129), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 09:21:40,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 161 transitions. [2024-11-10 09:21:40,763 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 161 transitions. Word has length 133 [2024-11-10 09:21:40,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:40,767 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 161 transitions. [2024-11-10 09:21:40,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:21:40,768 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 161 transitions. [2024-11-10 09:21:40,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-10 09:21:40,769 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:40,769 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:40,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-10 09:21:40,969 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-10 09:21:40,969 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:40,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:40,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1761938267, now seen corresponding path program 1 times [2024-11-10 09:21:40,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:21:40,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [663372397] [2024-11-10 09:21:40,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:40,971 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:21:40,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:21:40,973 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-10 09:21:40,975 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-10 09:21:41,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:41,453 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-10 09:21:41,457 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:21:41,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-10 09:21:41,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 09:21:41,500 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 19 treesize of output 19 [2024-11-10 09:21:41,545 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:21:41,545 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 60 treesize of output 30 [2024-11-10 09:21:41,562 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 09:21:41,563 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:21:41,563 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:21:41,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [663372397] [2024-11-10 09:21:41,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [663372397] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:41,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:41,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:21:41,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000357265] [2024-11-10 09:21:41,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:41,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:21:41,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:21:41,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:21:41,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:21:41,565 INFO L87 Difference]: Start difference. First operand 114 states and 161 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:21:41,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:41,843 INFO L93 Difference]: Finished difference Result 326 states and 462 transitions. [2024-11-10 09:21:41,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:21:41,844 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2024-11-10 09:21:41,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:41,846 INFO L225 Difference]: With dead ends: 326 [2024-11-10 09:21:41,846 INFO L226 Difference]: Without dead ends: 215 [2024-11-10 09:21:41,846 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:21:41,847 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 126 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:41,847 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 735 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:21:41,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-10 09:21:41,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 211. [2024-11-10 09:21:41,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 180 states have (on average 1.3555555555555556) internal successors, (244), 181 states have internal predecessors, (244), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-10 09:21:41,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 300 transitions. [2024-11-10 09:21:41,857 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 300 transitions. Word has length 133 [2024-11-10 09:21:41,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:41,858 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 300 transitions. [2024-11-10 09:21:41,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:21:41,858 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 300 transitions. [2024-11-10 09:21:41,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-10 09:21:41,859 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:41,859 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:41,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-10 09:21:42,059 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-10 09:21:42,060 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:42,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:42,061 INFO L85 PathProgramCache]: Analyzing trace with hash 983251047, now seen corresponding path program 1 times [2024-11-10 09:21:42,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:21:42,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1083839002] [2024-11-10 09:21:42,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:42,062 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:21:42,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:21:42,064 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 09:21:42,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-10 09:21:42,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:42,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 09:21:42,332 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:21:42,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-10 09:21:42,532 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 09:21:42,532 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:21:42,532 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:21:42,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1083839002] [2024-11-10 09:21:42,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1083839002] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:42,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:42,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 09:21:42,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259668923] [2024-11-10 09:21:42,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:42,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:21:42,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:21:42,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:21:42,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:21:42,535 INFO L87 Difference]: Start difference. First operand 211 states and 300 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:21:42,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:42,740 INFO L93 Difference]: Finished difference Result 613 states and 869 transitions. [2024-11-10 09:21:42,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:21:42,741 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 135 [2024-11-10 09:21:42,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:42,745 INFO L225 Difference]: With dead ends: 613 [2024-11-10 09:21:42,745 INFO L226 Difference]: Without dead ends: 405 [2024-11-10 09:21:42,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:21:42,747 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 243 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:42,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 400 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:21:42,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2024-11-10 09:21:42,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 361. [2024-11-10 09:21:42,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 300 states have (on average 1.3366666666666667) internal successors, (401), 302 states have internal predecessors, (401), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-10 09:21:42,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 513 transitions. [2024-11-10 09:21:42,802 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 513 transitions. Word has length 135 [2024-11-10 09:21:42,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:42,803 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 513 transitions. [2024-11-10 09:21:42,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:21:42,804 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 513 transitions. [2024-11-10 09:21:42,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-10 09:21:42,806 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:42,806 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:42,818 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-10 09:21:43,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:21:43,009 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:43,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:43,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1050235475, now seen corresponding path program 1 times [2024-11-10 09:21:43,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:21:43,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1371058957] [2024-11-10 09:21:43,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:43,011 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:21:43,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:21:43,014 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 09:21:43,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-10 09:21:43,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:43,368 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 09:21:43,373 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:21:43,421 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 09:21:43,421 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:21:43,421 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:21:43,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1371058957] [2024-11-10 09:21:43,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1371058957] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:43,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:43,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:21:43,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836720937] [2024-11-10 09:21:43,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:43,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:21:43,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:21:43,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:21:43,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:21:43,424 INFO L87 Difference]: Start difference. First operand 361 states and 513 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:21:43,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:43,492 INFO L93 Difference]: Finished difference Result 692 states and 981 transitions. [2024-11-10 09:21:43,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:21:43,496 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 135 [2024-11-10 09:21:43,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:43,498 INFO L225 Difference]: With dead ends: 692 [2024-11-10 09:21:43,498 INFO L226 Difference]: Without dead ends: 370 [2024-11-10 09:21:43,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:21:43,499 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 583 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-10 09:21:43,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 583 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:21:43,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2024-11-10 09:21:43,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 370. [2024-11-10 09:21:43,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 309 states have (on average 1.3268608414239482) internal successors, (410), 311 states have internal predecessors, (410), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-10 09:21:43,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 522 transitions. [2024-11-10 09:21:43,540 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 522 transitions. Word has length 135 [2024-11-10 09:21:43,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:43,541 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 522 transitions. [2024-11-10 09:21:43,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:21:43,541 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 522 transitions. [2024-11-10 09:21:43,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-10 09:21:43,542 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:43,542 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:43,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-10 09:21:43,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:21:43,743 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:43,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:43,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1601626540, now seen corresponding path program 1 times [2024-11-10 09:21:43,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:21:43,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2142308006] [2024-11-10 09:21:43,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:43,744 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:21:43,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:21:43,746 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 09:21:43,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-10 09:21:43,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:43,950 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 09:21:43,952 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:21:44,202 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 253 proven. 24 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2024-11-10 09:21:44,203 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 09:21:44,336 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 09:21:44,336 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:21:44,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2142308006] [2024-11-10 09:21:44,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2142308006] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-10 09:21:44,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 09:21:44,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2024-11-10 09:21:44,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968220839] [2024-11-10 09:21:44,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:44,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:21:44,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:21:44,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:21:44,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-10 09:21:44,340 INFO L87 Difference]: Start difference. First operand 370 states and 522 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:21:44,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:44,491 INFO L93 Difference]: Finished difference Result 884 states and 1225 transitions. [2024-11-10 09:21:44,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:21:44,492 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 138 [2024-11-10 09:21:44,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:44,495 INFO L225 Difference]: With dead ends: 884 [2024-11-10 09:21:44,495 INFO L226 Difference]: Without dead ends: 553 [2024-11-10 09:21:44,495 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-10 09:21:44,496 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 65 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:44,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 534 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:21:44,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2024-11-10 09:21:44,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 547. [2024-11-10 09:21:44,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 464 states have (on average 1.3017241379310345) internal successors, (604), 469 states have internal predecessors, (604), 74 states have call successors, (74), 8 states have call predecessors, (74), 8 states have return successors, (74), 69 states have call predecessors, (74), 74 states have call successors, (74) [2024-11-10 09:21:44,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 752 transitions. [2024-11-10 09:21:44,518 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 752 transitions. Word has length 138 [2024-11-10 09:21:44,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:44,519 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 752 transitions. [2024-11-10 09:21:44,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:21:44,519 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 752 transitions. [2024-11-10 09:21:44,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-10 09:21:44,520 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:44,520 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:44,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-10 09:21:44,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:21:44,725 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:44,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:44,725 INFO L85 PathProgramCache]: Analyzing trace with hash -216972001, now seen corresponding path program 1 times [2024-11-10 09:21:44,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:21:44,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1924695586] [2024-11-10 09:21:44,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:44,726 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:21:44,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:21:44,729 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 09:21:44,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-10 09:21:44,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:44,981 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 09:21:44,984 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:21:44,991 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-10 09:21:44,993 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-10 09:21:45,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-10 09:21:45,059 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 09:21:45,059 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:21:45,059 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:21:45,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1924695586] [2024-11-10 09:21:45,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1924695586] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:45,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:45,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:21:45,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100701409] [2024-11-10 09:21:45,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:45,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:21:45,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:21:45,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:21:45,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:21:45,062 INFO L87 Difference]: Start difference. First operand 547 states and 752 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:21:45,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:45,253 INFO L93 Difference]: Finished difference Result 1076 states and 1477 transitions. [2024-11-10 09:21:45,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:21:45,258 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 139 [2024-11-10 09:21:45,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:45,261 INFO L225 Difference]: With dead ends: 1076 [2024-11-10 09:21:45,261 INFO L226 Difference]: Without dead ends: 572 [2024-11-10 09:21:45,262 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:21:45,263 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 138 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:45,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 539 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:21:45,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2024-11-10 09:21:45,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 559. [2024-11-10 09:21:45,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 471 states have (on average 1.2845010615711252) internal successors, (605), 476 states have internal predecessors, (605), 78 states have call successors, (78), 9 states have call predecessors, (78), 9 states have return successors, (78), 73 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-10 09:21:45,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 761 transitions. [2024-11-10 09:21:45,289 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 761 transitions. Word has length 139 [2024-11-10 09:21:45,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:45,289 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 761 transitions. [2024-11-10 09:21:45,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:21:45,290 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 761 transitions. [2024-11-10 09:21:45,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-10 09:21:45,291 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:45,291 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:45,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-10 09:21:45,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:21:45,495 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:45,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:45,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1290579808, now seen corresponding path program 1 times [2024-11-10 09:21:45,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:21:45,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [721764013] [2024-11-10 09:21:45,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:45,496 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:21:45,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:21:45,499 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-10 09:21:45,499 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-10 09:21:45,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:45,861 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-10 09:21:45,865 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:21:45,873 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-10 09:21:46,026 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 30 treesize of output 23 [2024-11-10 09:21:46,190 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:21:46,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 31 [2024-11-10 09:21:46,221 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2024-11-10 09:21:46,221 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:21:46,221 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:21:46,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [721764013] [2024-11-10 09:21:46,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [721764013] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:46,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:46,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 09:21:46,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906866936] [2024-11-10 09:21:46,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:46,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 09:21:46,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:21:46,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 09:21:46,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:21:46,223 INFO L87 Difference]: Start difference. First operand 559 states and 761 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 09:21:46,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:46,665 INFO L93 Difference]: Finished difference Result 592 states and 796 transitions. [2024-11-10 09:21:46,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 09:21:46,666 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 139 [2024-11-10 09:21:46,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:46,669 INFO L225 Difference]: With dead ends: 592 [2024-11-10 09:21:46,669 INFO L226 Difference]: Without dead ends: 589 [2024-11-10 09:21:46,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-10 09:21:46,670 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 158 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:46,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 834 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 09:21:46,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2024-11-10 09:21:46,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2024-11-10 09:21:46,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 498 states have (on average 1.2690763052208835) internal successors, (632), 503 states have internal predecessors, (632), 78 states have call successors, (78), 12 states have call predecessors, (78), 12 states have return successors, (78), 73 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-10 09:21:46,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 788 transitions. [2024-11-10 09:21:46,711 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 788 transitions. Word has length 139 [2024-11-10 09:21:46,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:46,711 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 788 transitions. [2024-11-10 09:21:46,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 09:21:46,712 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 788 transitions. [2024-11-10 09:21:46,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-10 09:21:46,712 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:46,712 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:21:46,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-10 09:21:46,913 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-10 09:21:46,914 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:46,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:46,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1319208959, now seen corresponding path program 1 times [2024-11-10 09:21:46,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:21:46,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [659584361] [2024-11-10 09:21:46,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:46,915 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:21:46,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:21:46,917 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-10 09:21:46,918 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-10 09:21:47,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:47,267 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-10 09:21:47,271 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:21:47,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-10 09:21:47,684 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:21:47,685 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 121 treesize of output 77 [2024-11-10 09:21:53,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 09:22:09,312 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 203 treesize of output 167 [2024-11-10 09:22:09,336 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:22:09,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 287 treesize of output 125 [2024-11-10 09:22:09,848 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 284 proven. 0 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2024-11-10 09:22:09,848 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:22:09,848 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:22:09,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [659584361] [2024-11-10 09:22:09,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [659584361] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:22:09,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:22:09,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 09:22:09,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856361996] [2024-11-10 09:22:09,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:22:09,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 09:22:09,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:22:09,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 09:22:09,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=81, Unknown=1, NotChecked=0, Total=110 [2024-11-10 09:22:09,851 INFO L87 Difference]: Start difference. First operand 589 states and 788 transitions. Second operand has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 10 states have internal predecessors, (68), 3 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2024-11-10 09:22:12,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.59s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 09:22:19,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.66s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 09:22:23,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 09:22:26,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 09:22:29,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 09:22:31,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 09:22:37,772 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.55s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 09:22:42,093 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 09:22:54,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:22:54,082 INFO L93 Difference]: Finished difference Result 2070 states and 2735 transitions. [2024-11-10 09:22:54,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 09:22:54,099 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 10 states have internal predecessors, (68), 3 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 139 [2024-11-10 09:22:54,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:22:54,105 INFO L225 Difference]: With dead ends: 2070 [2024-11-10 09:22:54,106 INFO L226 Difference]: Without dead ends: 1536 [2024-11-10 09:22:54,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=47, Invalid=133, Unknown=2, NotChecked=0, Total=182 [2024-11-10 09:22:54,107 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 338 mSDsluCounter, 973 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 20 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 1140 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 37.6s IncrementalHoareTripleChecker+Time [2024-11-10 09:22:54,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 1140 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 432 Invalid, 7 Unknown, 0 Unchecked, 37.6s Time] [2024-11-10 09:22:54,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1536 states. [2024-11-10 09:22:54,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1536 to 1524. [2024-11-10 09:22:54,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1524 states, 1300 states have (on average 1.2507692307692309) internal successors, (1626), 1319 states have internal predecessors, (1626), 190 states have call successors, (190), 33 states have call predecessors, (190), 33 states have return successors, (190), 171 states have call predecessors, (190), 190 states have call successors, (190) [2024-11-10 09:22:54,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1524 states to 1524 states and 2006 transitions. [2024-11-10 09:22:54,195 INFO L78 Accepts]: Start accepts. Automaton has 1524 states and 2006 transitions. Word has length 139 [2024-11-10 09:22:54,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:22:54,195 INFO L471 AbstractCegarLoop]: Abstraction has 1524 states and 2006 transitions. [2024-11-10 09:22:54,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 10 states have internal predecessors, (68), 3 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2024-11-10 09:22:54,196 INFO L276 IsEmpty]: Start isEmpty. Operand 1524 states and 2006 transitions. [2024-11-10 09:22:54,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-10 09:22:54,197 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:22:54,197 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:22:54,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-10 09:22:54,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:22:54,402 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:22:54,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:22:54,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1232948002, now seen corresponding path program 1 times [2024-11-10 09:22:54,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:22:54,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [799579044] [2024-11-10 09:22:54,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:22:54,403 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:22:54,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:22:54,408 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 09:22:54,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-10 09:22:54,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:22:54,651 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 09:22:54,654 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:22:54,662 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-10 09:22:54,777 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 09:22:54,777 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:22:54,778 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:22:54,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [799579044] [2024-11-10 09:22:54,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [799579044] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:22:54,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:22:54,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:22:54,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798734125] [2024-11-10 09:22:54,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:22:54,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:22:54,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:22:54,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:22:54,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:22:54,779 INFO L87 Difference]: Start difference. First operand 1524 states and 2006 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:22:55,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:22:55,116 INFO L93 Difference]: Finished difference Result 2969 states and 3903 transitions. [2024-11-10 09:22:55,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:22:55,117 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 139 [2024-11-10 09:22:55,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:22:55,121 INFO L225 Difference]: With dead ends: 2969 [2024-11-10 09:22:55,121 INFO L226 Difference]: Without dead ends: 1530 [2024-11-10 09:22:55,123 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:22:55,123 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 117 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:22:55,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 654 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:22:55,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1530 states. [2024-11-10 09:22:55,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1530 to 1524. [2024-11-10 09:22:55,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1524 states, 1300 states have (on average 1.236923076923077) internal successors, (1608), 1319 states have internal predecessors, (1608), 190 states have call successors, (190), 33 states have call predecessors, (190), 33 states have return successors, (190), 171 states have call predecessors, (190), 190 states have call successors, (190) [2024-11-10 09:22:55,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1524 states to 1524 states and 1988 transitions. [2024-11-10 09:22:55,217 INFO L78 Accepts]: Start accepts. Automaton has 1524 states and 1988 transitions. Word has length 139 [2024-11-10 09:22:55,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:22:55,217 INFO L471 AbstractCegarLoop]: Abstraction has 1524 states and 1988 transitions. [2024-11-10 09:22:55,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:22:55,217 INFO L276 IsEmpty]: Start isEmpty. Operand 1524 states and 1988 transitions. [2024-11-10 09:22:55,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-10 09:22:55,218 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:22:55,218 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:22:55,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-11-10 09:22:55,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:22:55,423 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:22:55,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:22:55,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1429461507, now seen corresponding path program 1 times [2024-11-10 09:22:55,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:22:55,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1610898852] [2024-11-10 09:22:55,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:22:55,424 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:22:55,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:22:55,426 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-10 09:22:55,427 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-10 09:22:55,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:22:55,628 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 09:22:55,630 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:22:55,651 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 09:22:55,651 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:22:55,651 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:22:55,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1610898852] [2024-11-10 09:22:55,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1610898852] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:22:55,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:22:55,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:22:55,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103122168] [2024-11-10 09:22:55,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:22:55,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:22:55,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:22:55,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:22:55,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:22:55,652 INFO L87 Difference]: Start difference. First operand 1524 states and 1988 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:22:55,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:22:55,769 INFO L93 Difference]: Finished difference Result 3017 states and 3933 transitions. [2024-11-10 09:22:55,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:22:55,769 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 139 [2024-11-10 09:22:55,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:22:55,774 INFO L225 Difference]: With dead ends: 3017 [2024-11-10 09:22:55,774 INFO L226 Difference]: Without dead ends: 1578 [2024-11-10 09:22:55,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:22:55,776 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 0 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:22:55,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 580 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:22:55,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1578 states. [2024-11-10 09:22:55,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1578 to 1578. [2024-11-10 09:22:55,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1578 states, 1354 states have (on average 1.2274741506646971) internal successors, (1662), 1373 states have internal predecessors, (1662), 190 states have call successors, (190), 33 states have call predecessors, (190), 33 states have return successors, (190), 171 states have call predecessors, (190), 190 states have call successors, (190) [2024-11-10 09:22:55,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 2042 transitions. [2024-11-10 09:22:55,865 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 2042 transitions. Word has length 139 [2024-11-10 09:22:55,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:22:55,866 INFO L471 AbstractCegarLoop]: Abstraction has 1578 states and 2042 transitions. [2024-11-10 09:22:55,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:22:55,866 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 2042 transitions. [2024-11-10 09:22:55,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-10 09:22:55,867 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:22:55,867 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:22:55,875 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 (15)] Forceful destruction successful, exit code 0 [2024-11-10 09:22:56,071 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-10 09:22:56,072 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:22:56,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:22:56,072 INFO L85 PathProgramCache]: Analyzing trace with hash 109966720, now seen corresponding path program 1 times [2024-11-10 09:22:56,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:22:56,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [780330470] [2024-11-10 09:22:56,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:22:56,074 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:22:56,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:22:56,076 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-10 09:22:56,077 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-10 09:22:56,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:22:56,353 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 09:22:56,355 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:22:56,369 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2024-11-10 09:22:56,369 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:22:56,369 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:22:56,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [780330470] [2024-11-10 09:22:56,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [780330470] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:22:56,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:22:56,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:22:56,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704731303] [2024-11-10 09:22:56,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:22:56,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:22:56,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:22:56,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:22:56,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:22:56,371 INFO L87 Difference]: Start difference. First operand 1578 states and 2042 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 09:22:56,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:22:56,578 INFO L93 Difference]: Finished difference Result 3095 states and 4003 transitions. [2024-11-10 09:22:56,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:22:56,578 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 139 [2024-11-10 09:22:56,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:22:56,589 INFO L225 Difference]: With dead ends: 3095 [2024-11-10 09:22:56,590 INFO L226 Difference]: Without dead ends: 1578 [2024-11-10 09:22:56,592 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:22:56,597 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:22:56,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 442 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:22:56,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1578 states. [2024-11-10 09:22:56,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1578 to 1578. [2024-11-10 09:22:56,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1578 states, 1354 states have (on average 1.224519940915805) internal successors, (1658), 1373 states have internal predecessors, (1658), 190 states have call successors, (190), 33 states have call predecessors, (190), 33 states have return successors, (190), 171 states have call predecessors, (190), 190 states have call successors, (190) [2024-11-10 09:22:56,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 2038 transitions. [2024-11-10 09:22:56,801 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 2038 transitions. Word has length 139 [2024-11-10 09:22:56,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:22:56,801 INFO L471 AbstractCegarLoop]: Abstraction has 1578 states and 2038 transitions. [2024-11-10 09:22:56,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 09:22:56,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 2038 transitions. [2024-11-10 09:22:56,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-10 09:22:56,803 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:22:56,803 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:22:56,815 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-10 09:22:57,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:22:57,005 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:22:57,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:22:57,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1901327830, now seen corresponding path program 1 times [2024-11-10 09:22:57,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:22:57,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1617436700] [2024-11-10 09:22:57,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:22:57,006 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:22:57,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:22:57,010 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 09:22:57,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 (17)] Waiting until timeout for monitored process [2024-11-10 09:22:57,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:22:57,304 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 09:22:57,308 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:22:57,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-10 09:22:57,575 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 09:22:57,576 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:22:57,576 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:22:57,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1617436700] [2024-11-10 09:22:57,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1617436700] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:22:57,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:22:57,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:22:57,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207943498] [2024-11-10 09:22:57,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:22:57,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:22:57,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:22:57,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:22:57,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:22:57,579 INFO L87 Difference]: Start difference. First operand 1578 states and 2038 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:22:57,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:22:57,978 INFO L93 Difference]: Finished difference Result 3220 states and 4146 transitions. [2024-11-10 09:22:57,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:22:57,978 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 140 [2024-11-10 09:22:57,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:22:57,986 INFO L225 Difference]: With dead ends: 3220 [2024-11-10 09:22:57,986 INFO L226 Difference]: Without dead ends: 1727 [2024-11-10 09:22:57,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:22:57,990 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 239 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 09:22:57,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 520 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 09:22:57,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1727 states. [2024-11-10 09:22:58,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1727 to 1580. [2024-11-10 09:22:58,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1580 states, 1356 states have (on average 1.224188790560472) internal successors, (1660), 1375 states have internal predecessors, (1660), 190 states have call successors, (190), 33 states have call predecessors, (190), 33 states have return successors, (190), 171 states have call predecessors, (190), 190 states have call successors, (190) [2024-11-10 09:22:58,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 2040 transitions. [2024-11-10 09:22:58,118 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 2040 transitions. Word has length 140 [2024-11-10 09:22:58,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:22:58,118 INFO L471 AbstractCegarLoop]: Abstraction has 1580 states and 2040 transitions. [2024-11-10 09:22:58,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:22:58,119 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 2040 transitions. [2024-11-10 09:22:58,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-10 09:22:58,120 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:22:58,120 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:22:58,132 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 (17)] Ended with exit code 0 [2024-11-10 09:22:58,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:22:58,322 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:22:58,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:22:58,323 INFO L85 PathProgramCache]: Analyzing trace with hash 2138902921, now seen corresponding path program 1 times [2024-11-10 09:22:58,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:22:58,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [357292923] [2024-11-10 09:22:58,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:22:58,324 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:22:58,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:22:58,325 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-10 09:22:58,326 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-10 09:22:58,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:22:58,613 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 09:22:58,617 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:22:58,759 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 09:22:58,760 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:22:58,760 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:22:58,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [357292923] [2024-11-10 09:22:58,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [357292923] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:22:58,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:22:58,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 09:22:58,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354037666] [2024-11-10 09:22:58,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:22:58,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:22:58,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:22:58,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:22:58,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:22:58,762 INFO L87 Difference]: Start difference. First operand 1580 states and 2040 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:22:59,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:22:59,323 INFO L93 Difference]: Finished difference Result 3494 states and 4490 transitions. [2024-11-10 09:22:59,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 09:22:59,324 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 140 [2024-11-10 09:22:59,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:22:59,335 INFO L225 Difference]: With dead ends: 3494 [2024-11-10 09:22:59,335 INFO L226 Difference]: Without dead ends: 1999 [2024-11-10 09:22:59,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-10 09:22:59,338 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 73 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 09:22:59,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 778 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 09:22:59,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1999 states. [2024-11-10 09:22:59,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1999 to 1990. [2024-11-10 09:22:59,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1990 states, 1732 states have (on average 1.2113163972286374) internal successors, (2098), 1757 states have internal predecessors, (2098), 214 states have call successors, (214), 43 states have call predecessors, (214), 43 states have return successors, (214), 189 states have call predecessors, (214), 214 states have call successors, (214) [2024-11-10 09:22:59,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1990 states to 1990 states and 2526 transitions. [2024-11-10 09:22:59,470 INFO L78 Accepts]: Start accepts. Automaton has 1990 states and 2526 transitions. Word has length 140 [2024-11-10 09:22:59,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:22:59,470 INFO L471 AbstractCegarLoop]: Abstraction has 1990 states and 2526 transitions. [2024-11-10 09:22:59,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:22:59,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1990 states and 2526 transitions. [2024-11-10 09:22:59,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-10 09:22:59,473 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:22:59,473 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:22:59,482 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-10 09:22:59,676 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-10 09:22:59,677 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:22:59,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:22:59,678 INFO L85 PathProgramCache]: Analyzing trace with hash -802754678, now seen corresponding path program 1 times [2024-11-10 09:22:59,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:22:59,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1451055798] [2024-11-10 09:22:59,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:22:59,678 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:22:59,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:22:59,683 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-10 09:22:59,684 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-10 09:22:59,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:22:59,935 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 09:22:59,937 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:23:00,092 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 09:23:00,093 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:23:00,093 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:23:00,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1451055798] [2024-11-10 09:23:00,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1451055798] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:23:00,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:23:00,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 09:23:00,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676517869] [2024-11-10 09:23:00,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:23:00,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:23:00,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:23:00,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:23:00,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:23:00,096 INFO L87 Difference]: Start difference. First operand 1990 states and 2526 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:23:00,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:23:00,301 INFO L93 Difference]: Finished difference Result 3909 states and 4959 transitions. [2024-11-10 09:23:00,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:23:00,302 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 140 [2024-11-10 09:23:00,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:23:00,310 INFO L225 Difference]: With dead ends: 3909 [2024-11-10 09:23:00,311 INFO L226 Difference]: Without dead ends: 2008 [2024-11-10 09:23:00,314 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:23:00,314 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:23:00,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 719 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:23:00,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2008 states. [2024-11-10 09:23:00,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2008 to 1963. [2024-11-10 09:23:00,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1963 states, 1705 states have (on average 1.209384164222874) internal successors, (2062), 1730 states have internal predecessors, (2062), 214 states have call successors, (214), 43 states have call predecessors, (214), 43 states have return successors, (214), 189 states have call predecessors, (214), 214 states have call successors, (214) [2024-11-10 09:23:00,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1963 states to 1963 states and 2490 transitions. [2024-11-10 09:23:00,532 INFO L78 Accepts]: Start accepts. Automaton has 1963 states and 2490 transitions. Word has length 140 [2024-11-10 09:23:00,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:23:00,533 INFO L471 AbstractCegarLoop]: Abstraction has 1963 states and 2490 transitions. [2024-11-10 09:23:00,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:23:00,533 INFO L276 IsEmpty]: Start isEmpty. Operand 1963 states and 2490 transitions. [2024-11-10 09:23:00,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-10 09:23:00,535 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:23:00,535 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:23:00,545 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 (19)] Forceful destruction successful, exit code 0 [2024-11-10 09:23:00,736 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-10 09:23:00,736 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:23:00,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:23:00,737 INFO L85 PathProgramCache]: Analyzing trace with hash -71022211, now seen corresponding path program 1 times [2024-11-10 09:23:00,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:23:00,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [911035414] [2024-11-10 09:23:00,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:23:00,738 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:23:00,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:23:00,741 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-10 09:23:00,745 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