./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-31.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-31.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 84da415e9ad0a7cbbc07d5b79a769caa1c0599f3ba39b8d5c5504fcb214f076c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:34:00,701 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:34:00,765 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 00:34:00,770 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:34:00,771 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:34:00,799 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:34:00,801 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:34:00,801 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:34:00,802 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:34:00,803 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:34:00,803 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:34:00,804 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:34:00,804 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:34:00,805 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:34:00,806 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:34:00,806 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:34:00,806 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:34:00,806 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:34:00,806 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 00:34:00,806 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:34:00,807 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:34:00,807 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:34:00,809 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:34:00,809 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:34:00,809 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:34:00,810 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:34:00,810 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:34:00,810 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:34:00,810 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:34:00,810 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:34:00,810 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:34:00,811 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:34:00,811 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:34:00,811 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:34:00,811 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:34:00,811 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:34:00,811 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 00:34:00,811 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 00:34:00,811 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:34:00,812 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:34:00,812 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:34:00,813 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:34:00,813 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 -> 84da415e9ad0a7cbbc07d5b79a769caa1c0599f3ba39b8d5c5504fcb214f076c [2024-11-19 00:34:00,979 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:34:00,998 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:34:01,001 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:34:01,002 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:34:01,002 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:34:01,003 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-31.i [2024-11-19 00:34:02,279 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:34:02,420 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:34:02,420 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-31.i [2024-11-19 00:34:02,427 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da8125771/024bf0d2090b40cd84e12d12fb4e64fd/FLAG8fb42f61e [2024-11-19 00:34:02,438 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da8125771/024bf0d2090b40cd84e12d12fb4e64fd [2024-11-19 00:34:02,440 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:34:02,443 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:34:02,445 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:34:02,446 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:34:02,450 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:34:02,451 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:34:02" (1/1) ... [2024-11-19 00:34:02,453 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c308a8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:02, skipping insertion in model container [2024-11-19 00:34:02,453 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:34:02" (1/1) ... [2024-11-19 00:34:02,472 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:34:02,605 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-31.i[916,929] [2024-11-19 00:34:02,667 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:34:02,680 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:34:02,691 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-31.i[916,929] [2024-11-19 00:34:02,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:34:02,735 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:34:02,735 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:02 WrapperNode [2024-11-19 00:34:02,735 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:34:02,736 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:34:02,736 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:34:02,736 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:34:02,741 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:02" (1/1) ... [2024-11-19 00:34:02,750 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:02" (1/1) ... [2024-11-19 00:34:02,788 INFO L138 Inliner]: procedures = 29, calls = 136, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 415 [2024-11-19 00:34:02,788 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:34:02,789 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:34:02,789 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:34:02,789 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:34:02,803 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:02" (1/1) ... [2024-11-19 00:34:02,804 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:02" (1/1) ... [2024-11-19 00:34:02,812 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:02" (1/1) ... [2024-11-19 00:34:02,827 INFO L175 MemorySlicer]: Split 110 memory accesses to 5 slices as follows [2, 20, 22, 33, 33]. 30 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 2, 2, 4, 2]. The 16 writes are split as follows [0, 2, 5, 6, 3]. [2024-11-19 00:34:02,828 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:02" (1/1) ... [2024-11-19 00:34:02,828 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:02" (1/1) ... [2024-11-19 00:34:02,844 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:02" (1/1) ... [2024-11-19 00:34:02,848 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:02" (1/1) ... [2024-11-19 00:34:02,850 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:02" (1/1) ... [2024-11-19 00:34:02,856 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:02" (1/1) ... [2024-11-19 00:34:02,859 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:34:02,867 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:34:02,867 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:34:02,867 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:34:02,867 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:02" (1/1) ... [2024-11-19 00:34:02,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:34:02,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:34:02,904 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 00:34:02,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 00:34:02,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:34:02,944 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-19 00:34:02,945 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-19 00:34:02,945 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-19 00:34:02,945 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-19 00:34:02,945 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-19 00:34:02,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 00:34:02,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 00:34:02,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 00:34:02,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-19 00:34:02,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-19 00:34:02,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-19 00:34:02,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-19 00:34:02,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-19 00:34:02,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-19 00:34:02,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-19 00:34:02,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 00:34:02,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 00:34:02,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 00:34:02,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-19 00:34:02,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-19 00:34:02,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-19 00:34:02,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-19 00:34:02,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-19 00:34:02,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-19 00:34:02,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-19 00:34:02,950 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:34:02,950 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:34:02,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 00:34:02,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 00:34:02,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 00:34:02,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-19 00:34:02,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-19 00:34:02,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:34:02,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:34:03,064 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:34:03,066 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:34:03,368 INFO L? ?]: Removed 86 outVars from TransFormulas that were not future-live. [2024-11-19 00:34:03,368 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:34:03,383 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:34:03,384 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:34:03,384 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:34:03 BoogieIcfgContainer [2024-11-19 00:34:03,384 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:34:03,386 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:34:03,386 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:34:03,389 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:34:03,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:34:02" (1/3) ... [2024-11-19 00:34:03,389 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dc7b909 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:34:03, skipping insertion in model container [2024-11-19 00:34:03,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:02" (2/3) ... [2024-11-19 00:34:03,390 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dc7b909 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:34:03, skipping insertion in model container [2024-11-19 00:34:03,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:34:03" (3/3) ... [2024-11-19 00:34:03,391 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-31.i [2024-11-19 00:34:03,402 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:34:03,402 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:34:03,444 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:34:03,449 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;@36701cf5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:34:03,449 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:34:03,452 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 73 states have (on average 1.452054794520548) internal successors, (106), 74 states have internal predecessors, (106), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-19 00:34:03,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-19 00:34:03,459 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:34:03,459 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:34:03,460 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:34:03,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:34:03,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1922605135, now seen corresponding path program 1 times [2024-11-19 00:34:03,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:34:03,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403448063] [2024-11-19 00:34:03,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:34:03,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:34:03,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:34:03,743 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-11-19 00:34:03,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:34:03,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403448063] [2024-11-19 00:34:03,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403448063] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:34:03,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113150105] [2024-11-19 00:34:03,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:34:03,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:34:03,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:34:03,748 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:34:03,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 00:34:03,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:34:03,932 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:34:03,937 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:34:03,954 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-11-19 00:34:03,954 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:34:03,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113150105] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:34:03,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:34:03,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-19 00:34:03,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641810249] [2024-11-19 00:34:03,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:34:03,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:34:03,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:34:03,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:34:03,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:34:03,980 INFO L87 Difference]: Start difference. First operand has 87 states, 73 states have (on average 1.452054794520548) internal successors, (106), 74 states have internal predecessors, (106), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 00:34:03,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:34:03,999 INFO L93 Difference]: Finished difference Result 167 states and 261 transitions. [2024-11-19 00:34:04,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:34:04,001 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 94 [2024-11-19 00:34:04,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:34:04,006 INFO L225 Difference]: With dead ends: 167 [2024-11-19 00:34:04,006 INFO L226 Difference]: Without dead ends: 83 [2024-11-19 00:34:04,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:34:04,011 INFO L432 NwaCegarLoop]: 121 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, 121 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:34:04,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:34:04,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-19 00:34:04,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-19 00:34:04,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 70 states have (on average 1.4142857142857144) internal successors, (99), 70 states have internal predecessors, (99), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-19 00:34:04,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 121 transitions. [2024-11-19 00:34:04,046 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 121 transitions. Word has length 94 [2024-11-19 00:34:04,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:34:04,047 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 121 transitions. [2024-11-19 00:34:04,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 00:34:04,047 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 121 transitions. [2024-11-19 00:34:04,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-19 00:34:04,050 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:34:04,050 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:34:04,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 00:34:04,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-19 00:34:04,257 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:34:04,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:34:04,258 INFO L85 PathProgramCache]: Analyzing trace with hash 434162283, now seen corresponding path program 1 times [2024-11-19 00:34:04,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:34:04,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634751660] [2024-11-19 00:34:04,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:34:04,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:34:04,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:34:04,573 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-19 00:34:04,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:34:04,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634751660] [2024-11-19 00:34:04,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634751660] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:34:04,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:34:04,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:34:04,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491448306] [2024-11-19 00:34:04,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:34:04,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:34:04,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:34:04,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:34:04,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:34:04,576 INFO L87 Difference]: Start difference. First operand 83 states and 121 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:34:04,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:34:04,602 INFO L93 Difference]: Finished difference Result 163 states and 239 transitions. [2024-11-19 00:34:04,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:34:04,604 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 94 [2024-11-19 00:34:04,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:34:04,606 INFO L225 Difference]: With dead ends: 163 [2024-11-19 00:34:04,606 INFO L226 Difference]: Without dead ends: 83 [2024-11-19 00:34:04,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-19 00:34:04,608 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:34:04,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 235 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:34:04,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-19 00:34:04,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-19 00:34:04,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 70 states have (on average 1.4) internal successors, (98), 70 states have internal predecessors, (98), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-19 00:34:04,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 120 transitions. [2024-11-19 00:34:04,622 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 120 transitions. Word has length 94 [2024-11-19 00:34:04,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:34:04,624 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 120 transitions. [2024-11-19 00:34:04,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:34:04,625 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 120 transitions. [2024-11-19 00:34:04,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-19 00:34:04,627 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:34:04,628 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:34:04,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 00:34:04,628 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:34:04,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:34:04,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1154185619, now seen corresponding path program 1 times [2024-11-19 00:34:04,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:34:04,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934212942] [2024-11-19 00:34:04,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:34:04,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:34:04,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:34:05,875 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-19 00:34:05,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:34:05,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934212942] [2024-11-19 00:34:05,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934212942] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:34:05,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:34:05,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 00:34:05,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409295346] [2024-11-19 00:34:05,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:34:05,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 00:34:05,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:34:05,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 00:34:05,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:34:05,877 INFO L87 Difference]: Start difference. First operand 83 states and 120 transitions. Second operand has 8 states, 7 states have (on average 6.0) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 00:34:06,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:34:06,131 INFO L93 Difference]: Finished difference Result 222 states and 320 transitions. [2024-11-19 00:34:06,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 00:34:06,131 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.0) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 94 [2024-11-19 00:34:06,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:34:06,133 INFO L225 Difference]: With dead ends: 222 [2024-11-19 00:34:06,133 INFO L226 Difference]: Without dead ends: 142 [2024-11-19 00:34:06,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:34:06,134 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 79 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:34:06,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 817 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:34:06,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-19 00:34:06,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 139. [2024-11-19 00:34:06,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 118 states have (on average 1.3898305084745763) internal successors, (164), 119 states have internal predecessors, (164), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-19 00:34:06,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 200 transitions. [2024-11-19 00:34:06,158 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 200 transitions. Word has length 94 [2024-11-19 00:34:06,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:34:06,161 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 200 transitions. [2024-11-19 00:34:06,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.0) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 00:34:06,161 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 200 transitions. [2024-11-19 00:34:06,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-19 00:34:06,162 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:34:06,163 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:34:06,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 00:34:06,163 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:34:06,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:34:06,166 INFO L85 PathProgramCache]: Analyzing trace with hash -463624664, now seen corresponding path program 1 times [2024-11-19 00:34:06,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:34:06,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545195706] [2024-11-19 00:34:06,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:34:06,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:34:06,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:34:06,579 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-19 00:34:06,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:34:06,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545195706] [2024-11-19 00:34:06,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545195706] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:34:06,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:34:06,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:34:06,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360730062] [2024-11-19 00:34:06,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:34:06,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:34:06,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:34:06,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:34:06,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:34:06,581 INFO L87 Difference]: Start difference. First operand 139 states and 200 transitions. Second operand has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 00:34:06,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:34:06,641 INFO L93 Difference]: Finished difference Result 275 states and 397 transitions. [2024-11-19 00:34:06,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:34:06,642 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 96 [2024-11-19 00:34:06,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:34:06,645 INFO L225 Difference]: With dead ends: 275 [2024-11-19 00:34:06,646 INFO L226 Difference]: Without dead ends: 139 [2024-11-19 00:34:06,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:34:06,647 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:34:06,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 409 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:34:06,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-19 00:34:06,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2024-11-19 00:34:06,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 118 states have (on average 1.3728813559322033) internal successors, (162), 119 states have internal predecessors, (162), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-19 00:34:06,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 198 transitions. [2024-11-19 00:34:06,665 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 198 transitions. Word has length 96 [2024-11-19 00:34:06,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:34:06,667 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 198 transitions. [2024-11-19 00:34:06,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 00:34:06,668 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 198 transitions. [2024-11-19 00:34:06,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-19 00:34:06,669 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:34:06,669 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:34:06,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 00:34:06,669 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:34:06,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:34:06,670 INFO L85 PathProgramCache]: Analyzing trace with hash -856651674, now seen corresponding path program 1 times [2024-11-19 00:34:06,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:34:06,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792588659] [2024-11-19 00:34:06,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:34:06,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:34:06,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:34:07,147 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-19 00:34:07,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:34:07,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792588659] [2024-11-19 00:34:07,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792588659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:34:07,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:34:07,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 00:34:07,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729994616] [2024-11-19 00:34:07,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:34:07,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 00:34:07,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:34:07,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 00:34:07,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:34:07,149 INFO L87 Difference]: Start difference. First operand 139 states and 198 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:34:07,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:34:07,304 INFO L93 Difference]: Finished difference Result 304 states and 433 transitions. [2024-11-19 00:34:07,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:34:07,305 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 96 [2024-11-19 00:34:07,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:34:07,306 INFO L225 Difference]: With dead ends: 304 [2024-11-19 00:34:07,306 INFO L226 Difference]: Without dead ends: 168 [2024-11-19 00:34:07,307 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:34:07,308 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 86 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:34:07,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 674 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:34:07,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-19 00:34:07,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 113. [2024-11-19 00:34:07,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 92 states have (on average 1.3369565217391304) internal successors, (123), 93 states have internal predecessors, (123), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-19 00:34:07,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 159 transitions. [2024-11-19 00:34:07,319 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 159 transitions. Word has length 96 [2024-11-19 00:34:07,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:34:07,320 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 159 transitions. [2024-11-19 00:34:07,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:34:07,320 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 159 transitions. [2024-11-19 00:34:07,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-19 00:34:07,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:34:07,321 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:34:07,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 00:34:07,322 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:34:07,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:34:07,322 INFO L85 PathProgramCache]: Analyzing trace with hash 916608243, now seen corresponding path program 1 times [2024-11-19 00:34:07,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:34:07,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641185570] [2024-11-19 00:34:07,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:34:07,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:34:07,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:34:07,383 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-19 00:34:07,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:34:07,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641185570] [2024-11-19 00:34:07,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641185570] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:34:07,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:34:07,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:34:07,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517962949] [2024-11-19 00:34:07,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:34:07,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:34:07,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:34:07,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:34:07,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:34:07,385 INFO L87 Difference]: Start difference. First operand 113 states and 159 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:34:07,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:34:07,398 INFO L93 Difference]: Finished difference Result 204 states and 287 transitions. [2024-11-19 00:34:07,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:34:07,399 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 96 [2024-11-19 00:34:07,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:34:07,400 INFO L225 Difference]: With dead ends: 204 [2024-11-19 00:34:07,401 INFO L226 Difference]: Without dead ends: 114 [2024-11-19 00:34:07,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-19 00:34:07,402 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:34:07,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 230 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:34:07,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-19 00:34:07,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-11-19 00:34:07,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 93 states have (on average 1.3333333333333333) internal successors, (124), 94 states have internal predecessors, (124), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-19 00:34:07,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 160 transitions. [2024-11-19 00:34:07,415 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 160 transitions. Word has length 96 [2024-11-19 00:34:07,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:34:07,416 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 160 transitions. [2024-11-19 00:34:07,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:34:07,416 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 160 transitions. [2024-11-19 00:34:07,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-19 00:34:07,417 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:34:07,417 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:34:07,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 00:34:07,417 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:34:07,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:34:07,418 INFO L85 PathProgramCache]: Analyzing trace with hash 329802229, now seen corresponding path program 1 times [2024-11-19 00:34:07,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:34:07,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661537733] [2024-11-19 00:34:07,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:34:07,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:34:07,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:34:07,640 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-19 00:34:07,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:34:07,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661537733] [2024-11-19 00:34:07,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661537733] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:34:07,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:34:07,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:34:07,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358060536] [2024-11-19 00:34:07,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:34:07,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:34:07,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:34:07,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:34:07,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:34:07,642 INFO L87 Difference]: Start difference. First operand 114 states and 160 transitions. Second operand has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 00:34:07,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:34:07,729 INFO L93 Difference]: Finished difference Result 251 states and 345 transitions. [2024-11-19 00:34:07,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:34:07,730 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 96 [2024-11-19 00:34:07,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:34:07,731 INFO L225 Difference]: With dead ends: 251 [2024-11-19 00:34:07,732 INFO L226 Difference]: Without dead ends: 160 [2024-11-19 00:34:07,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-19 00:34:07,732 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 57 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:34:07,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 613 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:34:07,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-19 00:34:07,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 157. [2024-11-19 00:34:07,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 132 states have (on average 1.3257575757575757) internal successors, (175), 134 states have internal predecessors, (175), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-19 00:34:07,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 215 transitions. [2024-11-19 00:34:07,746 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 215 transitions. Word has length 96 [2024-11-19 00:34:07,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:34:07,746 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 215 transitions. [2024-11-19 00:34:07,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 00:34:07,746 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 215 transitions. [2024-11-19 00:34:07,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-19 00:34:07,747 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:34:07,747 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:34:07,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 00:34:07,748 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:34:07,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:34:07,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1874819353, now seen corresponding path program 1 times [2024-11-19 00:34:07,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:34:07,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043404101] [2024-11-19 00:34:07,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:34:07,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:34:07,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:34:07,928 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-19 00:34:07,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:34:07,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043404101] [2024-11-19 00:34:07,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043404101] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:34:07,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:34:07,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:34:07,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460008144] [2024-11-19 00:34:07,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:34:07,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:34:07,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:34:07,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:34:07,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:34:07,930 INFO L87 Difference]: Start difference. First operand 157 states and 215 transitions. Second operand has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 00:34:08,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:34:08,035 INFO L93 Difference]: Finished difference Result 287 states and 388 transitions. [2024-11-19 00:34:08,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:34:08,035 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 97 [2024-11-19 00:34:08,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:34:08,036 INFO L225 Difference]: With dead ends: 287 [2024-11-19 00:34:08,037 INFO L226 Difference]: Without dead ends: 157 [2024-11-19 00:34:08,037 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:34:08,037 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 46 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:34:08,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 534 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:34:08,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-19 00:34:08,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 122. [2024-11-19 00:34:08,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 99 states have (on average 1.292929292929293) internal successors, (128), 100 states have internal predecessors, (128), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-19 00:34:08,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 164 transitions. [2024-11-19 00:34:08,046 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 164 transitions. Word has length 97 [2024-11-19 00:34:08,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:34:08,047 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 164 transitions. [2024-11-19 00:34:08,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 00:34:08,047 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 164 transitions. [2024-11-19 00:34:08,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-19 00:34:08,048 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:34:08,048 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:34:08,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 00:34:08,048 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:34:08,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:34:08,048 INFO L85 PathProgramCache]: Analyzing trace with hash -421311151, now seen corresponding path program 1 times [2024-11-19 00:34:08,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:34:08,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142180322] [2024-11-19 00:34:08,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:34:08,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:34:08,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:34:08,366 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-19 00:34:08,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:34:08,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142180322] [2024-11-19 00:34:08,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142180322] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:34:08,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:34:08,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 00:34:08,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728378288] [2024-11-19 00:34:08,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:34:08,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 00:34:08,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:34:08,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 00:34:08,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:34:08,368 INFO L87 Difference]: Start difference. First operand 122 states and 164 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:34:08,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:34:08,497 INFO L93 Difference]: Finished difference Result 307 states and 411 transitions. [2024-11-19 00:34:08,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:34:08,497 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 98 [2024-11-19 00:34:08,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:34:08,498 INFO L225 Difference]: With dead ends: 307 [2024-11-19 00:34:08,498 INFO L226 Difference]: Without dead ends: 212 [2024-11-19 00:34:08,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:34:08,499 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 91 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:34:08,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 732 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:34:08,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-11-19 00:34:08,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 209. [2024-11-19 00:34:08,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 174 states have (on average 1.2988505747126438) internal successors, (226), 176 states have internal predecessors, (226), 27 states have call successors, (27), 7 states have call predecessors, (27), 7 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-19 00:34:08,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 280 transitions. [2024-11-19 00:34:08,513 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 280 transitions. Word has length 98 [2024-11-19 00:34:08,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:34:08,514 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 280 transitions. [2024-11-19 00:34:08,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:34:08,514 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 280 transitions. [2024-11-19 00:34:08,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-19 00:34:08,514 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:34:08,515 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:34:08,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 00:34:08,515 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:34:08,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:34:08,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1036545903, now seen corresponding path program 1 times [2024-11-19 00:34:08,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:34:08,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732081628] [2024-11-19 00:34:08,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:34:08,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:34:08,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:34:08,642 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-19 00:34:08,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:34:08,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732081628] [2024-11-19 00:34:08,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732081628] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:34:08,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:34:08,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:34:08,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187853271] [2024-11-19 00:34:08,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:34:08,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:34:08,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:34:08,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:34:08,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:34:08,644 INFO L87 Difference]: Start difference. First operand 209 states and 280 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:34:08,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:34:08,704 INFO L93 Difference]: Finished difference Result 466 states and 626 transitions. [2024-11-19 00:34:08,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:34:08,704 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2024-11-19 00:34:08,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:34:08,706 INFO L225 Difference]: With dead ends: 466 [2024-11-19 00:34:08,706 INFO L226 Difference]: Without dead ends: 284 [2024-11-19 00:34:08,706 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:34:08,707 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 89 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:34:08,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 364 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:34:08,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-11-19 00:34:08,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 217. [2024-11-19 00:34:08,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 182 states have (on average 1.2857142857142858) internal successors, (234), 184 states have internal predecessors, (234), 27 states have call successors, (27), 7 states have call predecessors, (27), 7 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-19 00:34:08,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 288 transitions. [2024-11-19 00:34:08,721 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 288 transitions. Word has length 99 [2024-11-19 00:34:08,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:34:08,722 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 288 transitions. [2024-11-19 00:34:08,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:34:08,722 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 288 transitions. [2024-11-19 00:34:08,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-19 00:34:08,723 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:34:08,723 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:34:08,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 00:34:08,723 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:34:08,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:34:08,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1365186479, now seen corresponding path program 1 times [2024-11-19 00:34:08,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:34:08,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399447229] [2024-11-19 00:34:08,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:34:08,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:34:08,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:34:08,821 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-19 00:34:08,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:34:08,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399447229] [2024-11-19 00:34:08,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399447229] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:34:08,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87718087] [2024-11-19 00:34:08,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:34:08,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:34:08,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:34:08,824 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:34:08,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 00:34:08,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:34:08,957 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 00:34:08,960 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:34:09,009 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-19 00:34:09,009 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:34:09,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87718087] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:34:09,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:34:09,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2024-11-19 00:34:09,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98848837] [2024-11-19 00:34:09,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:34:09,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:34:09,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:34:09,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:34:09,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:34:09,011 INFO L87 Difference]: Start difference. First operand 217 states and 288 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:34:09,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:34:09,046 INFO L93 Difference]: Finished difference Result 413 states and 548 transitions. [2024-11-19 00:34:09,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:34:09,046 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2024-11-19 00:34:09,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:34:09,048 INFO L225 Difference]: With dead ends: 413 [2024-11-19 00:34:09,048 INFO L226 Difference]: Without dead ends: 223 [2024-11-19 00:34:09,048 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:34:09,049 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:34:09,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 454 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:34:09,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-19 00:34:09,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 219. [2024-11-19 00:34:09,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 184 states have (on average 1.2826086956521738) internal successors, (236), 186 states have internal predecessors, (236), 27 states have call successors, (27), 7 states have call predecessors, (27), 7 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-19 00:34:09,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 290 transitions. [2024-11-19 00:34:09,063 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 290 transitions. Word has length 99 [2024-11-19 00:34:09,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:34:09,063 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 290 transitions. [2024-11-19 00:34:09,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:34:09,064 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 290 transitions. [2024-11-19 00:34:09,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-19 00:34:09,064 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:34:09,065 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:34:09,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 00:34:09,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-19 00:34:09,266 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:34:09,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:34:09,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1572870353, now seen corresponding path program 1 times [2024-11-19 00:34:09,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:34:09,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608498090] [2024-11-19 00:34:09,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:34:09,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:34:09,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:34:09,444 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-19 00:34:09,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:34:09,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608498090] [2024-11-19 00:34:09,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608498090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:34:09,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:34:09,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:34:09,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86594189] [2024-11-19 00:34:09,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:34:09,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:34:09,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:34:09,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:34:09,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:34:09,447 INFO L87 Difference]: Start difference. First operand 219 states and 290 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:34:09,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:34:09,550 INFO L93 Difference]: Finished difference Result 546 states and 718 transitions. [2024-11-19 00:34:09,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 00:34:09,551 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2024-11-19 00:34:09,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:34:09,552 INFO L225 Difference]: With dead ends: 546 [2024-11-19 00:34:09,552 INFO L226 Difference]: Without dead ends: 354 [2024-11-19 00:34:09,553 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:34:09,553 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 71 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:34:09,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 791 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:34:09,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-11-19 00:34:09,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 227. [2024-11-19 00:34:09,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 192 states have (on average 1.2916666666666667) internal successors, (248), 194 states have internal predecessors, (248), 27 states have call successors, (27), 7 states have call predecessors, (27), 7 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-19 00:34:09,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 302 transitions. [2024-11-19 00:34:09,583 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 302 transitions. Word has length 99 [2024-11-19 00:34:09,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:34:09,583 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 302 transitions. [2024-11-19 00:34:09,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:34:09,584 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 302 transitions. [2024-11-19 00:34:09,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-19 00:34:09,584 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:34:09,585 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:34:09,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 00:34:09,585 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:34:09,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:34:09,585 INFO L85 PathProgramCache]: Analyzing trace with hash 551801999, now seen corresponding path program 1 times [2024-11-19 00:34:09,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:34:09,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083048002] [2024-11-19 00:34:09,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:34:09,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:34:09,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:34:09,806 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-19 00:34:09,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:34:09,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083048002] [2024-11-19 00:34:09,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083048002] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:34:09,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:34:09,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 00:34:09,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457252846] [2024-11-19 00:34:09,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:34:09,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 00:34:09,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:34:09,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 00:34:09,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:34:09,808 INFO L87 Difference]: Start difference. First operand 227 states and 302 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:34:09,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:34:09,953 INFO L93 Difference]: Finished difference Result 538 states and 707 transitions. [2024-11-19 00:34:09,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 00:34:09,954 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2024-11-19 00:34:09,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:34:09,956 INFO L225 Difference]: With dead ends: 538 [2024-11-19 00:34:09,956 INFO L226 Difference]: Without dead ends: 338 [2024-11-19 00:34:09,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 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-19 00:34:09,957 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 132 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:34:09,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 573 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:34:09,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2024-11-19 00:34:09,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 191. [2024-11-19 00:34:09,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 164 states have (on average 1.2865853658536586) internal successors, (211), 165 states have internal predecessors, (211), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-19 00:34:09,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 251 transitions. [2024-11-19 00:34:09,974 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 251 transitions. Word has length 99 [2024-11-19 00:34:09,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:34:09,974 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 251 transitions. [2024-11-19 00:34:09,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:34:09,974 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 251 transitions. [2024-11-19 00:34:09,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-19 00:34:09,975 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:34:09,975 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:34:09,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 00:34:09,975 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:34:09,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:34:09,976 INFO L85 PathProgramCache]: Analyzing trace with hash -2001270962, now seen corresponding path program 1 times [2024-11-19 00:34:09,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:34:09,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423186168] [2024-11-19 00:34:09,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:34:09,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:34:10,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 00:34:10,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1661437080] [2024-11-19 00:34:10,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:34:10,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:34:10,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:34:10,012 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:34:10,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 00:34:10,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:34:10,167 INFO L255 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-19 00:34:10,172 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:34:10,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-19 00:34:10,510 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 29 treesize of output 13 [2024-11-19 00:34:10,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-19 00:34:10,730 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:34:10,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 36 [2024-11-19 00:34:10,788 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:34:10,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 49 [2024-11-19 00:34:10,876 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:34:10,877 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 68 treesize of output 24 [2024-11-19 00:34:10,889 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-19 00:34:10,890 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:34:10,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:34:10,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423186168] [2024-11-19 00:34:10,891 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 00:34:10,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661437080] [2024-11-19 00:34:10,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1661437080] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:34:10,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:34:10,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 00:34:10,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98584603] [2024-11-19 00:34:10,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:34:10,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 00:34:10,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:34:10,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 00:34:10,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:34:10,892 INFO L87 Difference]: Start difference. First operand 191 states and 251 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:34:11,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:34:11,208 INFO L93 Difference]: Finished difference Result 510 states and 669 transitions. [2024-11-19 00:34:11,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 00:34:11,208 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2024-11-19 00:34:11,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:34:11,209 INFO L225 Difference]: With dead ends: 510 [2024-11-19 00:34:11,210 INFO L226 Difference]: Without dead ends: 322 [2024-11-19 00:34:11,210 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-19 00:34:11,210 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 147 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:34:11,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 860 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:34:11,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-11-19 00:34:11,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 273. [2024-11-19 00:34:11,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 231 states have (on average 1.2727272727272727) internal successors, (294), 232 states have internal predecessors, (294), 31 states have call successors, (31), 10 states have call predecessors, (31), 10 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-19 00:34:11,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 356 transitions. [2024-11-19 00:34:11,231 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 356 transitions. Word has length 99 [2024-11-19 00:34:11,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:34:11,231 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 356 transitions. [2024-11-19 00:34:11,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:34:11,232 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 356 transitions. [2024-11-19 00:34:11,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-19 00:34:11,232 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:34:11,233 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:34:11,246 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 00:34:11,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:34:11,437 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:34:11,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:34:11,438 INFO L85 PathProgramCache]: Analyzing trace with hash 325744351, now seen corresponding path program 1 times [2024-11-19 00:34:11,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:34:11,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967943552] [2024-11-19 00:34:11,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:34:11,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:34:11,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:34:11,564 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-19 00:34:11,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:34:11,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967943552] [2024-11-19 00:34:11,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967943552] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:34:11,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113544249] [2024-11-19 00:34:11,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:34:11,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:34:11,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:34:11,567 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:34:11,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 00:34:11,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:34:11,709 INFO L255 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 00:34:11,711 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:34:11,739 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-19 00:34:11,739 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:34:11,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113544249] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:34:11,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:34:11,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2024-11-19 00:34:11,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901491632] [2024-11-19 00:34:11,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:34:11,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:34:11,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:34:11,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:34:11,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:34:11,741 INFO L87 Difference]: Start difference. First operand 273 states and 356 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:34:11,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:34:11,780 INFO L93 Difference]: Finished difference Result 469 states and 614 transitions. [2024-11-19 00:34:11,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:34:11,781 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 100 [2024-11-19 00:34:11,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:34:11,783 INFO L225 Difference]: With dead ends: 469 [2024-11-19 00:34:11,783 INFO L226 Difference]: Without dead ends: 281 [2024-11-19 00:34:11,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:34:11,784 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:34:11,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 556 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:34:11,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-11-19 00:34:11,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 278. [2024-11-19 00:34:11,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 236 states have (on average 1.2669491525423728) internal successors, (299), 237 states have internal predecessors, (299), 31 states have call successors, (31), 10 states have call predecessors, (31), 10 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-19 00:34:11,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 361 transitions. [2024-11-19 00:34:11,803 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 361 transitions. Word has length 100 [2024-11-19 00:34:11,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:34:11,803 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 361 transitions. [2024-11-19 00:34:11,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:34:11,803 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 361 transitions. [2024-11-19 00:34:11,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-19 00:34:11,804 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:34:11,804 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:34:11,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-19 00:34:12,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-19 00:34:12,005 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:34:12,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:34:12,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1298355466, now seen corresponding path program 1 times [2024-11-19 00:34:12,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:34:12,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694448293] [2024-11-19 00:34:12,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:34:12,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:34:12,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 00:34:12,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1693288516] [2024-11-19 00:34:12,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:34:12,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:34:12,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:34:12,072 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:34:12,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 00:34:12,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 00:34:12,277 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 00:34:12,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 00:34:12,417 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 00:34:12,418 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 00:34:12,419 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 00:34:12,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-19 00:34:12,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-19 00:34:12,623 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:34:12,699 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 00:34:12,703 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 12:34:12 BoogieIcfgContainer [2024-11-19 00:34:12,703 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 00:34:12,704 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 00:34:12,704 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 00:34:12,704 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 00:34:12,704 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:34:03" (3/4) ... [2024-11-19 00:34:12,706 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 00:34:12,707 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 00:34:12,707 INFO L158 Benchmark]: Toolchain (without parser) took 10263.71ms. Allocated memory was 167.8MB in the beginning and 388.0MB in the end (delta: 220.2MB). Free memory was 108.4MB in the beginning and 206.0MB in the end (delta: -97.6MB). Peak memory consumption was 122.7MB. Max. memory is 16.1GB. [2024-11-19 00:34:12,707 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 167.8MB. Free memory is still 130.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 00:34:12,708 INFO L158 Benchmark]: CACSL2BoogieTranslator took 290.23ms. Allocated memory is still 167.8MB. Free memory was 107.7MB in the beginning and 91.8MB in the end (delta: 15.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 00:34:12,708 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.22ms. Allocated memory is still 167.8MB. Free memory was 91.8MB in the beginning and 88.3MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 00:34:12,708 INFO L158 Benchmark]: Boogie Preprocessor took 69.98ms. Allocated memory is still 167.8MB. Free memory was 88.3MB in the beginning and 83.3MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 00:34:12,709 INFO L158 Benchmark]: RCFGBuilder took 517.76ms. Allocated memory is still 167.8MB. Free memory was 83.3MB in the beginning and 51.9MB in the end (delta: 31.4MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-19 00:34:12,709 INFO L158 Benchmark]: TraceAbstraction took 9317.43ms. Allocated memory was 167.8MB in the beginning and 388.0MB in the end (delta: 220.2MB). Free memory was 51.9MB in the beginning and 207.0MB in the end (delta: -155.1MB). Peak memory consumption was 68.2MB. Max. memory is 16.1GB. [2024-11-19 00:34:12,709 INFO L158 Benchmark]: Witness Printer took 3.15ms. Allocated memory is still 388.0MB. Free memory is still 206.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 00:34:12,710 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 167.8MB. Free memory is still 130.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 290.23ms. Allocated memory is still 167.8MB. Free memory was 107.7MB in the beginning and 91.8MB in the end (delta: 15.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.22ms. Allocated memory is still 167.8MB. Free memory was 91.8MB in the beginning and 88.3MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.98ms. Allocated memory is still 167.8MB. Free memory was 88.3MB in the beginning and 83.3MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 517.76ms. Allocated memory is still 167.8MB. Free memory was 83.3MB in the beginning and 51.9MB in the end (delta: 31.4MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 9317.43ms. Allocated memory was 167.8MB in the beginning and 388.0MB in the end (delta: 220.2MB). Free memory was 51.9MB in the beginning and 207.0MB in the end (delta: -155.1MB). Peak memory consumption was 68.2MB. Max. memory is 16.1GB. * Witness Printer took 3.15ms. Allocated memory is still 388.0MB. Free memory is still 206.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 98. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L25-L27] double double_Array_0[2] = { 0.97, 32.6 }; [L25-L27] double double_Array_0[2] = { 0.97, 32.6 }; [L25-L27] double double_Array_0[2] = { 0.97, 32.6 }; [L28-L30] signed long int signed_long_int_Array_0[2][2] = { {-32, 1107940323}, {4, 200} }; [L28-L30] signed long int signed_long_int_Array_0[2][2] = { {-32, 1107940323}, {4, 200} }; [L28-L30] signed long int signed_long_int_Array_0[2][2] = { {-32, 1107940323}, {4, 200} }; [L28-L30] signed long int signed_long_int_Array_0[2][2] = { {-32, 1107940323}, {4, 200} }; [L28-L30] signed long int signed_long_int_Array_0[2][2] = { {-32, 1107940323}, {4, 200} }; [L31-L33] unsigned char unsigned_char_Array_0[2] = { 4, 64 }; [L31-L33] unsigned char unsigned_char_Array_0[2] = { 4, 64 }; [L31-L33] unsigned char unsigned_char_Array_0[2] = { 4, 64 }; [L34] double last_1_double_Array_0_0_ = 0.97; [L35] signed long int last_1_signed_long_int_Array_0_1__0_ = 4; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=0, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L102] isInitial = 1 [L103] FCALL initially() [L104] COND TRUE 1 [L105] CALL updateLastVariables() [L94] EXPR double_Array_0[0] [L94] last_1_double_Array_0_0_ = double_Array_0[0] [L95] EXPR signed_long_int_Array_0[1][0] [L95] last_1_signed_long_int_Array_0_1__0_ = signed_long_int_Array_0[1][0] [L105] RET updateLastVariables() [L106] CALL updateVariables() [L75] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L76] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L76] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L76] 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}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L77] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L77] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L77] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L78] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L79] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L79] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L79] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L80] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L80] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L80] 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}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L81] double_Array_0[1] = __VERIFIER_nondet_double() [L82] EXPR double_Array_0[1] [L82] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L82] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F [L82] EXPR double_Array_0[1] [L82] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L82] EXPR (double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L82] EXPR (double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L82] CALL assume_abort_if_not((double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L82] RET assume_abort_if_not((double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] signed_long_int_Array_0[0][0] = __VERIFIER_nondet_long() [L84] EXPR signed_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L84] CALL assume_abort_if_not(signed_long_int_Array_0[0][0] >= -1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L84] RET assume_abort_if_not(signed_long_int_Array_0[0][0] >= -1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L85] EXPR signed_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L85] CALL assume_abort_if_not(signed_long_int_Array_0[0][0] <= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L85] RET assume_abort_if_not(signed_long_int_Array_0[0][0] <= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L86] signed_long_int_Array_0[0][1] = __VERIFIER_nondet_long() [L87] EXPR signed_long_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L87] CALL assume_abort_if_not(signed_long_int_Array_0[0][1] >= 1073741822) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L87] RET assume_abort_if_not(signed_long_int_Array_0[0][1] >= 1073741822) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L88] EXPR signed_long_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L88] CALL assume_abort_if_not(signed_long_int_Array_0[0][1] <= 2147483646) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L88] RET assume_abort_if_not(signed_long_int_Array_0[0][1] <= 2147483646) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L89] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L90] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L90] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L90] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L91] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L91] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L91] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L106] RET updateVariables() [L107] CALL step() [L39] EXPR signed_long_int_Array_0[0][1] [L39] EXPR signed_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L39] COND FALSE !(! (signed_long_int_Array_0[0][1] < (signed_long_int_Array_0[0][0] * last_1_signed_long_int_Array_0_1__0_))) [L46] EXPR unsigned_char_Array_0[0] [L46] unsigned_char_Array_0[1] = unsigned_char_Array_0[0] [L48] EXPR unsigned_char_Array_0[1] [L48] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L48] COND FALSE !(unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) [L51] EXPR unsigned_char_Array_0[1] [L51] EXPR signed_long_int_Array_0[0][1] [L51] signed_long_int_Array_0[1][0] = (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1]) [L53] EXPR unsigned_char_Array_0[1] [L53] EXPR signed_long_int_Array_0[0][1] [L53] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L53] COND FALSE !((unsigned_char_Array_0[1] + signed_long_int_Array_0[0][1]) < unsigned_char_Array_0[1]) [L64] EXPR double_Array_0[1] [L64] double_Array_0[0] = double_Array_0[1] [L66] BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L66] COND TRUE BOOL_unsigned_char_Array_0[1] [L67] EXPR signed_long_int_Array_0[0][1] [L67] EXPR unsigned_char_Array_0[1] [L67] EXPR unsigned_char_Array_0[1] [L67] signed_long_int_Array_0[1][1] = ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]) [L107] RET step() [L108] CALL, EXPR property() [L98] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L98] EXPR BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : ((BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[1][1] == ((signed long int) signed_long_int_Array_0[0][1])) : 1) [L98] EXPR signed_long_int_Array_0[1][1] [L98] EXPR signed_long_int_Array_0[0][1] [L98] EXPR unsigned_char_Array_0[1] [L98] EXPR unsigned_char_Array_0[1] [L98] EXPR BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : ((BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[1][1] == ((signed long int) signed_long_int_Array_0[0][1])) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L98] EXPR (BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : ((BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[1][1] == ((signed long int) signed_long_int_Array_0[0][1])) : 1)) && ((unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L98] EXPR (BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : ((BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[1][1] == ((signed long int) signed_long_int_Array_0[0][1])) : 1)) && ((unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1])))) [L98] EXPR unsigned_char_Array_0[1] [L98] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L98] EXPR (unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1]))) [L98] EXPR signed_long_int_Array_0[1][0] [L98] EXPR unsigned_char_Array_0[1] [L98] EXPR signed_long_int_Array_0[0][1] [L98] EXPR (unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L98] EXPR (BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : ((BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[1][1] == ((signed long int) signed_long_int_Array_0[0][1])) : 1)) && ((unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L98] EXPR ((BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : ((BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[1][1] == ((signed long int) signed_long_int_Array_0[0][1])) : 1)) && ((unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1]))))) && ((! (signed_long_int_Array_0[0][1] < (signed_long_int_Array_0[0][0] * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) : 1) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L98] EXPR ((BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : ((BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[1][1] == ((signed long int) signed_long_int_Array_0[0][1])) : 1)) && ((unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1]))))) && ((! (signed_long_int_Array_0[0][1] < (signed_long_int_Array_0[0][0] * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) : 1) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) [L98] EXPR signed_long_int_Array_0[0][1] [L98] EXPR signed_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L98] EXPR (! (signed_long_int_Array_0[0][1] < (signed_long_int_Array_0[0][0] * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) : 1) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) [L98] EXPR unsigned_char_Array_0[1] [L98] EXPR unsigned_char_Array_0[0] [L98] EXPR (! (signed_long_int_Array_0[0][1] < (signed_long_int_Array_0[0][0] * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) : 1) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L98] EXPR ((BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : ((BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[1][1] == ((signed long int) signed_long_int_Array_0[0][1])) : 1)) && ((unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1]))))) && ((! (signed_long_int_Array_0[0][1] < (signed_long_int_Array_0[0][0] * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) : 1) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L98] EXPR (((BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : ((BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[1][1] == ((signed long int) signed_long_int_Array_0[0][1])) : 1)) && ((unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1]))))) && ((! (signed_long_int_Array_0[0][1] < (signed_long_int_Array_0[0][0] * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) : 1) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])))) && (((unsigned_char_Array_0[1] + signed_long_int_Array_0[0][1]) < unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (double_Array_0[0] == ((double) 0.8)) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L98] EXPR (((BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : ((BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[1][1] == ((signed long int) signed_long_int_Array_0[0][1])) : 1)) && ((unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1]))))) && ((! (signed_long_int_Array_0[0][1] < (signed_long_int_Array_0[0][0] * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) : 1) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])))) && (((unsigned_char_Array_0[1] + signed_long_int_Array_0[0][1]) < unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (double_Array_0[0] == ((double) 0.8)) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1]))) [L98] EXPR unsigned_char_Array_0[1] [L98] EXPR signed_long_int_Array_0[0][1] [L98] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L98] EXPR ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0][1]) < unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (double_Array_0[0] == ((double) 0.8)) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1])) [L98] EXPR double_Array_0[0] [L98] EXPR double_Array_0[1] [L98] EXPR ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0][1]) < unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (double_Array_0[0] == ((double) 0.8)) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L98] EXPR (((BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : ((BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[1][1] == ((signed long int) signed_long_int_Array_0[0][1])) : 1)) && ((unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1]))))) && ((! (signed_long_int_Array_0[0][1] < (signed_long_int_Array_0[0][0] * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) : 1) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])))) && (((unsigned_char_Array_0[1] + signed_long_int_Array_0[0][1]) < unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (double_Array_0[0] == ((double) 0.8)) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L98-L99] return (((BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : ((BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[1][1] == ((signed long int) signed_long_int_Array_0[0][1])) : 1)) && ((unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1]))))) && ((! (signed_long_int_Array_0[0][1] < (signed_long_int_Array_0[0][0] * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) : 1) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])))) && (((unsigned_char_Array_0[1] + signed_long_int_Array_0[0][1]) < unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (double_Array_0[0] == ((double) 0.8)) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1]))) ; [L108] RET, EXPR property() [L108] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 87 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.2s, OverallIterations: 16, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 802 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 798 mSDsluCounter, 7963 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5960 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1530 IncrementalHoareTripleChecker+Invalid, 1568 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 2003 mSDtfsCounter, 1530 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 509 GetRequests, 428 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=278occurred in iteration=15, InterpolantAutomatonStates: 90, 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, 15 MinimizatonAttempts, 496 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 2048 NumberOfCodeBlocks, 2048 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1731 ConstructedInterpolants, 0 QuantifiedInterpolants, 4964 SizeOfPredicates, 7 NumberOfNonLiveVariables, 1438 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 18 InterpolantComputations, 15 PerfectInterpolantSequences, 3880/3960 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-19 00:34:12,741 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-31.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 84da415e9ad0a7cbbc07d5b79a769caa1c0599f3ba39b8d5c5504fcb214f076c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:34:14,572 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:34:14,629 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-19 00:34:14,634 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:34:14,634 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:34:14,661 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:34:14,663 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:34:14,663 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:34:14,664 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:34:14,664 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:34:14,664 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:34:14,664 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:34:14,665 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:34:14,665 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:34:14,665 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:34:14,665 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:34:14,665 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:34:14,666 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:34:14,666 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:34:14,666 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:34:14,668 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:34:14,668 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:34:14,668 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:34:14,668 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 00:34:14,669 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 00:34:14,669 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:34:14,669 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 00:34:14,669 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:34:14,669 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:34:14,670 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:34:14,670 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:34:14,670 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:34:14,670 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:34:14,671 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:34:14,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:34:14,682 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:34:14,682 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:34:14,682 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:34:14,682 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 00:34:14,683 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 00:34:14,683 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:34:14,683 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:34:14,683 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:34:14,683 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:34:14,683 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 -> 84da415e9ad0a7cbbc07d5b79a769caa1c0599f3ba39b8d5c5504fcb214f076c [2024-11-19 00:34:14,903 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:34:14,919 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:34:14,921 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:34:14,922 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:34:14,923 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:34:14,924 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-31.i [2024-11-19 00:34:16,120 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:34:16,299 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:34:16,300 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-31.i [2024-11-19 00:34:16,310 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c11b86d9/d2060a7e4fbb4f629180585153cbd96c/FLAG13608421a [2024-11-19 00:34:16,322 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c11b86d9/d2060a7e4fbb4f629180585153cbd96c [2024-11-19 00:34:16,324 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:34:16,325 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:34:16,327 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:34:16,327 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:34:16,331 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:34:16,331 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:34:16" (1/1) ... [2024-11-19 00:34:16,332 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7eec9c30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:16, skipping insertion in model container [2024-11-19 00:34:16,332 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:34:16" (1/1) ... [2024-11-19 00:34:16,354 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:34:16,485 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-31.i[916,929] [2024-11-19 00:34:16,541 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:34:16,555 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:34:16,563 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-31.i[916,929] [2024-11-19 00:34:16,623 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:34:16,658 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:34:16,658 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:16 WrapperNode [2024-11-19 00:34:16,658 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:34:16,659 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:34:16,659 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:34:16,659 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:34:16,664 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:16" (1/1) ... [2024-11-19 00:34:16,683 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:16" (1/1) ... [2024-11-19 00:34:16,720 INFO L138 Inliner]: procedures = 33, calls = 136, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 413 [2024-11-19 00:34:16,723 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:34:16,724 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:34:16,724 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:34:16,724 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:34:16,733 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:16" (1/1) ... [2024-11-19 00:34:16,734 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:16" (1/1) ... [2024-11-19 00:34:16,741 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:16" (1/1) ... [2024-11-19 00:34:16,770 INFO L175 MemorySlicer]: Split 110 memory accesses to 5 slices as follows [2, 20, 22, 33, 33]. 30 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 2, 2, 4, 2]. The 16 writes are split as follows [0, 2, 5, 6, 3]. [2024-11-19 00:34:16,770 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:16" (1/1) ... [2024-11-19 00:34:16,771 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:16" (1/1) ... [2024-11-19 00:34:16,796 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:16" (1/1) ... [2024-11-19 00:34:16,799 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:16" (1/1) ... [2024-11-19 00:34:16,810 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:16" (1/1) ... [2024-11-19 00:34:16,812 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:16" (1/1) ... [2024-11-19 00:34:16,822 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:34:16,823 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:34:16,824 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:34:16,824 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:34:16,824 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:16" (1/1) ... [2024-11-19 00:34:16,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:34:16,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:34:16,853 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 00:34:16,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 00:34:16,894 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:34:16,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-19 00:34:16,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-19 00:34:16,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-19 00:34:16,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-19 00:34:16,896 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-19 00:34:16,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-19 00:34:16,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-19 00:34:16,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-19 00:34:16,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-19 00:34:16,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-19 00:34:16,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-19 00:34:16,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-19 00:34:16,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-19 00:34:16,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-19 00:34:16,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-19 00:34:16,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 00:34:16,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 00:34:16,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-19 00:34:16,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-19 00:34:16,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-19 00:34:16,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-19 00:34:16,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-19 00:34:16,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-19 00:34:16,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-19 00:34:16,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-19 00:34:16,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-19 00:34:16,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-19 00:34:16,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-19 00:34:16,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-19 00:34:16,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-19 00:34:16,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 00:34:16,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 00:34:16,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-19 00:34:16,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-19 00:34:16,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-19 00:34:16,902 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:34:16,902 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:34:16,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:34:16,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:34:16,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-19 00:34:16,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-19 00:34:16,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-19 00:34:16,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-19 00:34:16,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-19 00:34:16,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-19 00:34:16,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-19 00:34:16,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-19 00:34:16,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-19 00:34:16,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-19 00:34:17,011 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:34:17,013 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:34:17,491 INFO L? ?]: Removed 86 outVars from TransFormulas that were not future-live. [2024-11-19 00:34:17,491 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:34:17,504 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:34:17,505 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:34:17,505 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:34:17 BoogieIcfgContainer [2024-11-19 00:34:17,506 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:34:17,507 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:34:17,507 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:34:17,509 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:34:17,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:34:16" (1/3) ... [2024-11-19 00:34:17,510 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@215469cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:34:17, skipping insertion in model container [2024-11-19 00:34:17,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:16" (2/3) ... [2024-11-19 00:34:17,510 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@215469cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:34:17, skipping insertion in model container [2024-11-19 00:34:17,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:34:17" (3/3) ... [2024-11-19 00:34:17,511 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-31.i [2024-11-19 00:34:17,524 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:34:17,524 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:34:17,568 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:34:17,573 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;@469f2cff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:34:17,574 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:34:17,577 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 73 states have (on average 1.452054794520548) internal successors, (106), 74 states have internal predecessors, (106), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-19 00:34:17,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-19 00:34:17,585 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:34:17,586 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:34:17,586 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:34:17,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:34:17,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1922605135, now seen corresponding path program 1 times [2024-11-19 00:34:17,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:34:17,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [346857003] [2024-11-19 00:34:17,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:34:17,602 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:34:17,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:34:17,605 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:34:17,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-19 00:34:17,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:34:17,825 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:34:17,831 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:34:17,859 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-19 00:34:17,862 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:34:17,863 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:34:17,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [346857003] [2024-11-19 00:34:17,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [346857003] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:34:17,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:34:17,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 00:34:17,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296503118] [2024-11-19 00:34:17,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:34:17,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:34:17,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:34:17,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:34:17,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:34:17,888 INFO L87 Difference]: Start difference. First operand has 87 states, 73 states have (on average 1.452054794520548) internal successors, (106), 74 states have internal predecessors, (106), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 00:34:17,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:34:17,911 INFO L93 Difference]: Finished difference Result 164 states and 256 transitions. [2024-11-19 00:34:17,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:34:17,913 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 94 [2024-11-19 00:34:17,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:34:17,918 INFO L225 Difference]: With dead ends: 164 [2024-11-19 00:34:17,918 INFO L226 Difference]: Without dead ends: 80 [2024-11-19 00:34:17,920 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:34:17,923 INFO L432 NwaCegarLoop]: 114 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, 114 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:34:17,923 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:34:17,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-19 00:34:17,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-19 00:34:17,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 67 states have (on average 1.373134328358209) internal successors, (92), 67 states have internal predecessors, (92), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-19 00:34:17,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 114 transitions. [2024-11-19 00:34:17,951 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 114 transitions. Word has length 94 [2024-11-19 00:34:17,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:34:17,952 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 114 transitions. [2024-11-19 00:34:17,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 00:34:17,952 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 114 transitions. [2024-11-19 00:34:17,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-19 00:34:17,954 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:34:17,954 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:34:17,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-19 00:34:18,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:34:18,155 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:34:18,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:34:18,156 INFO L85 PathProgramCache]: Analyzing trace with hash 434162283, now seen corresponding path program 1 times [2024-11-19 00:34:18,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:34:18,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1889611547] [2024-11-19 00:34:18,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:34:18,157 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:34:18,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:34:18,158 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:34:18,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-19 00:34:18,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:34:18,352 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 00:34:18,360 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:34:18,413 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-19 00:34:18,443 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-19 00:34:18,443 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:34:18,443 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:34:18,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1889611547] [2024-11-19 00:34:18,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1889611547] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:34:18,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:34:18,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:34:18,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546797193] [2024-11-19 00:34:18,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:34:18,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:34:18,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:34:18,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:34:18,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:34:18,448 INFO L87 Difference]: Start difference. First operand 80 states and 114 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:34:18,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:34:18,474 INFO L93 Difference]: Finished difference Result 157 states and 225 transitions. [2024-11-19 00:34:18,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:34:18,475 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 94 [2024-11-19 00:34:18,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:34:18,476 INFO L225 Difference]: With dead ends: 157 [2024-11-19 00:34:18,476 INFO L226 Difference]: Without dead ends: 80 [2024-11-19 00:34:18,476 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 92 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-19 00:34:18,477 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 0 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:34:18,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 221 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:34:18,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-19 00:34:18,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-19 00:34:18,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 67 states have (on average 1.3582089552238805) internal successors, (91), 67 states have internal predecessors, (91), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-19 00:34:18,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 113 transitions. [2024-11-19 00:34:18,484 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 113 transitions. Word has length 94 [2024-11-19 00:34:18,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:34:18,486 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 113 transitions. [2024-11-19 00:34:18,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:34:18,487 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 113 transitions. [2024-11-19 00:34:18,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-19 00:34:18,490 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:34:18,490 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:34:18,501 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-19 00:34:18,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:34:18,691 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:34:18,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:34:18,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1154185619, now seen corresponding path program 1 times [2024-11-19 00:34:18,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:34:18,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1518834264] [2024-11-19 00:34:18,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:34:18,692 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:34:18,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:34:18,695 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:34:18,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-19 00:34:18,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:34:18,918 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-19 00:34:18,924 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:34:18,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 00:34:19,043 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 29 treesize of output 13 [2024-11-19 00:34:19,058 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 42 treesize of output 35 [2024-11-19 00:34:19,162 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 108 proven. 9 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2024-11-19 00:34:19,163 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:34:19,291 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-19 00:34:19,292 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:34:19,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1518834264] [2024-11-19 00:34:19,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1518834264] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 00:34:19,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:34:19,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 11 [2024-11-19 00:34:19,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687509635] [2024-11-19 00:34:19,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:34:19,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:34:19,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:34:19,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:34:19,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:34:19,294 INFO L87 Difference]: Start difference. First operand 80 states and 113 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:34:19,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:34:19,614 INFO L93 Difference]: Finished difference Result 214 states and 302 transitions. [2024-11-19 00:34:19,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:34:19,615 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 94 [2024-11-19 00:34:19,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:34:19,616 INFO L225 Difference]: With dead ends: 214 [2024-11-19 00:34:19,616 INFO L226 Difference]: Without dead ends: 137 [2024-11-19 00:34:19,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-19 00:34:19,617 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 75 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:34:19,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 479 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:34:19,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-19 00:34:19,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 134. [2024-11-19 00:34:19,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 113 states have (on average 1.3539823008849559) internal successors, (153), 114 states have internal predecessors, (153), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-19 00:34:19,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 189 transitions. [2024-11-19 00:34:19,635 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 189 transitions. Word has length 94 [2024-11-19 00:34:19,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:34:19,635 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 189 transitions. [2024-11-19 00:34:19,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:34:19,636 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 189 transitions. [2024-11-19 00:34:19,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-19 00:34:19,636 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:34:19,637 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:34:19,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-19 00:34:19,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:34:19,837 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:34:19,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:34:19,838 INFO L85 PathProgramCache]: Analyzing trace with hash -463624664, now seen corresponding path program 1 times [2024-11-19 00:34:19,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:34:19,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [730184434] [2024-11-19 00:34:19,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:34:19,839 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:34:19,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:34:19,841 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:34:19,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-19 00:34:19,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:34:19,988 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 00:34:19,991 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:34:20,003 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-19 00:34:20,016 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-19 00:34:20,017 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:34:20,017 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:34:20,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [730184434] [2024-11-19 00:34:20,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [730184434] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:34:20,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:34:20,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:34:20,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515812719] [2024-11-19 00:34:20,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:34:20,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:34:20,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:34:20,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:34:20,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:34:20,018 INFO L87 Difference]: Start difference. First operand 134 states and 189 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:34:20,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:34:20,036 INFO L93 Difference]: Finished difference Result 265 states and 375 transitions. [2024-11-19 00:34:20,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:34:20,037 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 96 [2024-11-19 00:34:20,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:34:20,039 INFO L225 Difference]: With dead ends: 265 [2024-11-19 00:34:20,039 INFO L226 Difference]: Without dead ends: 134 [2024-11-19 00:34:20,039 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 94 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-19 00:34:20,040 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:34:20,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 218 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:34:20,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-19 00:34:20,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2024-11-19 00:34:20,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 113 states have (on average 1.336283185840708) internal successors, (151), 114 states have internal predecessors, (151), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-19 00:34:20,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 187 transitions. [2024-11-19 00:34:20,054 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 187 transitions. Word has length 96 [2024-11-19 00:34:20,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:34:20,055 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 187 transitions. [2024-11-19 00:34:20,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:34:20,055 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 187 transitions. [2024-11-19 00:34:20,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-19 00:34:20,057 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:34:20,058 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:34:20,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-19 00:34:20,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:34:20,258 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:34:20,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:34:20,259 INFO L85 PathProgramCache]: Analyzing trace with hash -856651674, now seen corresponding path program 1 times [2024-11-19 00:34:20,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:34:20,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [885732887] [2024-11-19 00:34:20,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:34:20,259 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:34:20,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:34:20,262 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:34:20,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-19 00:34:20,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:34:20,481 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-19 00:34:20,485 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:34:20,502 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-19 00:34:20,581 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 40 treesize of output 33 [2024-11-19 00:34:20,641 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:34:20,642 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 68 treesize of output 58 [2024-11-19 00:34:21,007 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:34:21,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 152 treesize of output 98 [2024-11-19 00:34:21,067 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 108 proven. 9 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2024-11-19 00:34:21,067 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:34:21,184 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-19 00:34:21,184 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:34:21,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [885732887] [2024-11-19 00:34:21,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [885732887] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 00:34:21,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:34:21,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 13 [2024-11-19 00:34:21,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445580906] [2024-11-19 00:34:21,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:34:21,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:34:21,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:34:21,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:34:21,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-19 00:34:21,186 INFO L87 Difference]: Start difference. First operand 134 states and 187 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:34:21,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:34:21,438 INFO L93 Difference]: Finished difference Result 294 states and 411 transitions. [2024-11-19 00:34:21,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:34:21,438 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 96 [2024-11-19 00:34:21,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:34:21,439 INFO L225 Difference]: With dead ends: 294 [2024-11-19 00:34:21,440 INFO L226 Difference]: Without dead ends: 163 [2024-11-19 00:34:21,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-19 00:34:21,441 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 82 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:34:21,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 541 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:34:21,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-19 00:34:21,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 110. [2024-11-19 00:34:21,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 89 states have (on average 1.303370786516854) internal successors, (116), 90 states have internal predecessors, (116), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-19 00:34:21,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 152 transitions. [2024-11-19 00:34:21,457 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 152 transitions. Word has length 96 [2024-11-19 00:34:21,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:34:21,457 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 152 transitions. [2024-11-19 00:34:21,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:34:21,458 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 152 transitions. [2024-11-19 00:34:21,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-19 00:34:21,458 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:34:21,458 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:34:21,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-19 00:34:21,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:34:21,664 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:34:21,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:34:21,664 INFO L85 PathProgramCache]: Analyzing trace with hash 916608243, now seen corresponding path program 1 times [2024-11-19 00:34:21,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:34:21,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1643325472] [2024-11-19 00:34:21,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:34:21,665 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:34:21,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:34:21,666 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:34:21,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-19 00:34:21,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:34:21,811 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 00:34:21,813 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:34:21,833 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-19 00:34:21,833 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:34:21,833 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:34:21,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1643325472] [2024-11-19 00:34:21,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1643325472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:34:21,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:34:21,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:34:21,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257478261] [2024-11-19 00:34:21,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:34:21,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:34:21,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:34:21,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:34:21,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:34:21,834 INFO L87 Difference]: Start difference. First operand 110 states and 152 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:34:21,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:34:21,848 INFO L93 Difference]: Finished difference Result 198 states and 273 transitions. [2024-11-19 00:34:21,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:34:21,849 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 96 [2024-11-19 00:34:21,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:34:21,850 INFO L225 Difference]: With dead ends: 198 [2024-11-19 00:34:21,850 INFO L226 Difference]: Without dead ends: 111 [2024-11-19 00:34:21,850 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 94 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-19 00:34:21,851 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:34:21,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 216 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:34:21,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-19 00:34:21,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-19 00:34:21,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 90 states have (on average 1.3) internal successors, (117), 91 states have internal predecessors, (117), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-19 00:34:21,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 153 transitions. [2024-11-19 00:34:21,859 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 153 transitions. Word has length 96 [2024-11-19 00:34:21,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:34:21,859 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 153 transitions. [2024-11-19 00:34:21,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:34:21,859 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 153 transitions. [2024-11-19 00:34:21,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-19 00:34:21,860 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:34:21,861 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:34:21,868 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-19 00:34:22,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:34:22,066 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:34:22,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:34:22,067 INFO L85 PathProgramCache]: Analyzing trace with hash 329802229, now seen corresponding path program 1 times [2024-11-19 00:34:22,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:34:22,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1940261575] [2024-11-19 00:34:22,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:34:22,067 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:34:22,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:34:22,070 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:34:22,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-19 00:34:22,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:34:22,218 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 00:34:22,220 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:34:22,385 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 100 proven. 21 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-11-19 00:34:22,385 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:34:22,446 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-19 00:34:22,446 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:34:22,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1940261575] [2024-11-19 00:34:22,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1940261575] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 00:34:22,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:34:22,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2024-11-19 00:34:22,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925715896] [2024-11-19 00:34:22,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:34:22,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:34:22,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:34:22,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:34:22,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:34:22,448 INFO L87 Difference]: Start difference. First operand 111 states and 153 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:34:22,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:34:22,550 INFO L93 Difference]: Finished difference Result 243 states and 327 transitions. [2024-11-19 00:34:22,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:34:22,550 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 96 [2024-11-19 00:34:22,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:34:22,551 INFO L225 Difference]: With dead ends: 243 [2024-11-19 00:34:22,552 INFO L226 Difference]: Without dead ends: 155 [2024-11-19 00:34:22,553 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 182 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-19 00:34:22,553 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 53 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:34:22,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 456 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:34:22,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-19 00:34:22,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 152. [2024-11-19 00:34:22,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 127 states have (on average 1.2913385826771653) internal successors, (164), 129 states have internal predecessors, (164), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-19 00:34:22,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 204 transitions. [2024-11-19 00:34:22,573 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 204 transitions. Word has length 96 [2024-11-19 00:34:22,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:34:22,573 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 204 transitions. [2024-11-19 00:34:22,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:34:22,574 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 204 transitions. [2024-11-19 00:34:22,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-19 00:34:22,576 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:34:22,576 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:34:22,583 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-19 00:34:22,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:34:22,777 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:34:22,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:34:22,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1874819353, now seen corresponding path program 1 times [2024-11-19 00:34:22,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:34:22,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [331440109] [2024-11-19 00:34:22,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:34:22,778 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:34:22,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:34:22,779 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:34:22,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-19 00:34:22,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:34:22,922 INFO L255 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 00:34:22,925 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:34:23,087 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 33 treesize of output 15 [2024-11-19 00:34:23,103 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 100 proven. 21 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-11-19 00:34:23,103 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:34:23,204 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-19 00:34:23,205 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:34:23,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [331440109] [2024-11-19 00:34:23,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [331440109] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 00:34:23,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:34:23,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-11-19 00:34:23,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560834758] [2024-11-19 00:34:23,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:34:23,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:34:23,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:34:23,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:34:23,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-19 00:34:23,206 INFO L87 Difference]: Start difference. First operand 152 states and 204 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:34:23,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:34:23,282 INFO L93 Difference]: Finished difference Result 277 states and 366 transitions. [2024-11-19 00:34:23,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:34:23,283 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 97 [2024-11-19 00:34:23,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:34:23,284 INFO L225 Difference]: With dead ends: 277 [2024-11-19 00:34:23,284 INFO L226 Difference]: Without dead ends: 152 [2024-11-19 00:34:23,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-19 00:34:23,285 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 80 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:34:23,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 317 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:34:23,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-19 00:34:23,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 119. [2024-11-19 00:34:23,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 96 states have (on average 1.2604166666666667) internal successors, (121), 97 states have internal predecessors, (121), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-19 00:34:23,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 157 transitions. [2024-11-19 00:34:23,296 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 157 transitions. Word has length 97 [2024-11-19 00:34:23,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:34:23,297 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 157 transitions. [2024-11-19 00:34:23,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:34:23,297 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 157 transitions. [2024-11-19 00:34:23,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-19 00:34:23,298 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:34:23,299 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:34:23,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-19 00:34:23,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:34:23,500 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:34:23,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:34:23,500 INFO L85 PathProgramCache]: Analyzing trace with hash -421311151, now seen corresponding path program 1 times [2024-11-19 00:34:23,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:34:23,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2009120956] [2024-11-19 00:34:23,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:34:23,501 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:34:23,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:34:23,502 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:34:23,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-19 00:34:23,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:34:23,694 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 00:34:23,700 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:34:23,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 00:34:23,715 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-19 00:34:23,757 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:34:23,758 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-19 00:34:23,775 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-19 00:34:23,776 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:34:23,776 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:34:23,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2009120956] [2024-11-19 00:34:23,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2009120956] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:34:23,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:34:23,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:34:23,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840538533] [2024-11-19 00:34:23,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:34:23,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:34:23,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:34:23,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:34:23,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:34:23,779 INFO L87 Difference]: Start difference. First operand 119 states and 157 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:34:23,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:34:23,922 INFO L93 Difference]: Finished difference Result 299 states and 393 transitions. [2024-11-19 00:34:23,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:34:23,923 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 98 [2024-11-19 00:34:23,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:34:23,924 INFO L225 Difference]: With dead ends: 299 [2024-11-19 00:34:23,924 INFO L226 Difference]: Without dead ends: 207 [2024-11-19 00:34:23,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:34:23,925 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 87 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:34:23,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 634 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:34:23,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-11-19 00:34:23,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 204. [2024-11-19 00:34:23,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 169 states have (on average 1.272189349112426) internal successors, (215), 171 states have internal predecessors, (215), 27 states have call successors, (27), 7 states have call predecessors, (27), 7 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-19 00:34:23,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 269 transitions. [2024-11-19 00:34:23,953 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 269 transitions. Word has length 98 [2024-11-19 00:34:23,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:34:23,953 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 269 transitions. [2024-11-19 00:34:23,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:34:23,953 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 269 transitions. [2024-11-19 00:34:23,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-19 00:34:23,954 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:34:23,955 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:34:23,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-19 00:34:24,158 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-19 00:34:24,159 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:34:24,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:34:24,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1036545903, now seen corresponding path program 1 times [2024-11-19 00:34:24,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:34:24,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1461986721] [2024-11-19 00:34:24,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:34:24,160 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:34:24,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:34:24,161 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-19 00:34:24,162 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-19 00:34:24,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:34:24,294 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 00:34:24,296 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:34:24,326 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-19 00:34:24,326 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:34:24,326 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:34:24,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1461986721] [2024-11-19 00:34:24,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1461986721] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:34:24,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:34:24,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:34:24,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202805513] [2024-11-19 00:34:24,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:34:24,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:34:24,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:34:24,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:34:24,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:34:24,328 INFO L87 Difference]: Start difference. First operand 204 states and 269 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:34:24,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:34:24,410 INFO L93 Difference]: Finished difference Result 452 states and 596 transitions. [2024-11-19 00:34:24,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:34:24,411 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2024-11-19 00:34:24,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:34:24,412 INFO L225 Difference]: With dead ends: 452 [2024-11-19 00:34:24,412 INFO L226 Difference]: Without dead ends: 275 [2024-11-19 00:34:24,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 95 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-19 00:34:24,413 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 42 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:34:24,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 451 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:34:24,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-11-19 00:34:24,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 212. [2024-11-19 00:34:24,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 177 states have (on average 1.2598870056497176) internal successors, (223), 179 states have internal predecessors, (223), 27 states have call successors, (27), 7 states have call predecessors, (27), 7 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-19 00:34:24,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 277 transitions. [2024-11-19 00:34:24,426 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 277 transitions. Word has length 99 [2024-11-19 00:34:24,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:34:24,426 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 277 transitions. [2024-11-19 00:34:24,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:34:24,426 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 277 transitions. [2024-11-19 00:34:24,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-19 00:34:24,427 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:34:24,427 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:34:24,433 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-19 00:34:24,627 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-19 00:34:24,628 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:34:24,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:34:24,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1365186479, now seen corresponding path program 1 times [2024-11-19 00:34:24,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:34:24,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1764977594] [2024-11-19 00:34:24,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:34:24,629 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:34:24,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:34:24,630 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:34:24,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-19 00:34:24,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:34:24,762 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 00:34:24,764 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:34:24,787 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-19 00:34:24,787 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:34:24,787 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:34:24,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1764977594] [2024-11-19 00:34:24,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1764977594] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:34:24,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:34:24,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:34:24,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751757787] [2024-11-19 00:34:24,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:34:24,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:34:24,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:34:24,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:34:24,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:34:24,789 INFO L87 Difference]: Start difference. First operand 212 states and 277 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:34:24,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:34:24,818 INFO L93 Difference]: Finished difference Result 403 states and 526 transitions. [2024-11-19 00:34:24,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:34:24,819 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2024-11-19 00:34:24,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:34:24,820 INFO L225 Difference]: With dead ends: 403 [2024-11-19 00:34:24,820 INFO L226 Difference]: Without dead ends: 218 [2024-11-19 00:34:24,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:34:24,821 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:34:24,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 426 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:34:24,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-19 00:34:24,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 214. [2024-11-19 00:34:24,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 179 states have (on average 1.2569832402234637) internal successors, (225), 181 states have internal predecessors, (225), 27 states have call successors, (27), 7 states have call predecessors, (27), 7 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-19 00:34:24,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 279 transitions. [2024-11-19 00:34:24,832 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 279 transitions. Word has length 99 [2024-11-19 00:34:24,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:34:24,832 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 279 transitions. [2024-11-19 00:34:24,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:34:24,832 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 279 transitions. [2024-11-19 00:34:24,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-19 00:34:24,833 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:34:24,833 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:34:24,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-19 00:34:25,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:34:25,034 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:34:25,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:34:25,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1572870353, now seen corresponding path program 1 times [2024-11-19 00:34:25,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:34:25,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1762987238] [2024-11-19 00:34:25,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:34:25,035 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:34:25,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:34:25,036 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:34:25,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-19 00:34:25,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:34:25,200 INFO L255 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 00:34:25,203 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:34:25,211 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-19 00:34:25,275 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 29 treesize of output 13 [2024-11-19 00:34:25,289 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 37 treesize of output 19 [2024-11-19 00:34:25,312 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 108 proven. 9 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2024-11-19 00:34:25,312 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:34:25,369 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:34:25,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1762987238] [2024-11-19 00:34:25,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1762987238] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:34:25,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [455223386] [2024-11-19 00:34:25,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:34:25,369 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 00:34:25,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 00:34:25,372 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-19 00:34:25,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2024-11-19 00:34:25,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:34:25,890 INFO L255 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 00:34:25,893 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:34:25,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 15 [2024-11-19 00:34:26,024 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-19 00:34:26,024 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:34:26,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [455223386] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:34:26,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:34:26,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2024-11-19 00:34:26,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633652326] [2024-11-19 00:34:26,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:34:26,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 00:34:26,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:34:26,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 00:34:26,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-11-19 00:34:26,026 INFO L87 Difference]: Start difference. First operand 214 states and 279 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:34:26,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:34:26,276 INFO L93 Difference]: Finished difference Result 532 states and 688 transitions. [2024-11-19 00:34:26,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 00:34:26,277 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2024-11-19 00:34:26,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:34:26,278 INFO L225 Difference]: With dead ends: 532 [2024-11-19 00:34:26,279 INFO L226 Difference]: Without dead ends: 345 [2024-11-19 00:34:26,279 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2024-11-19 00:34:26,280 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 126 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:34:26,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 659 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:34:26,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-11-19 00:34:26,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 222. [2024-11-19 00:34:26,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 187 states have (on average 1.267379679144385) internal successors, (237), 189 states have internal predecessors, (237), 27 states have call successors, (27), 7 states have call predecessors, (27), 7 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-19 00:34:26,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 291 transitions. [2024-11-19 00:34:26,302 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 291 transitions. Word has length 99 [2024-11-19 00:34:26,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:34:26,303 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 291 transitions. [2024-11-19 00:34:26,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:34:26,303 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 291 transitions. [2024-11-19 00:34:26,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-19 00:34:26,304 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:34:26,304 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:34:26,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Forceful destruction successful, exit code 0 [2024-11-19 00:34:26,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-11-19 00:34:26,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:34:26,705 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:34:26,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:34:26,706 INFO L85 PathProgramCache]: Analyzing trace with hash 551801999, now seen corresponding path program 1 times [2024-11-19 00:34:26,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:34:26,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2005489822] [2024-11-19 00:34:26,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:34:26,706 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:34:26,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:34:26,708 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:34:26,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-19 00:34:26,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:34:26,850 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 00:34:26,852 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:34:26,891 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-19 00:34:26,891 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:34:26,891 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:34:26,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2005489822] [2024-11-19 00:34:26,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2005489822] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:34:26,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:34:26,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:34:26,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276680844] [2024-11-19 00:34:26,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:34:26,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:34:26,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:34:26,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:34:26,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:34:26,892 INFO L87 Difference]: Start difference. First operand 222 states and 291 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:34:27,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:34:27,088 INFO L93 Difference]: Finished difference Result 524 states and 677 transitions. [2024-11-19 00:34:27,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:34:27,088 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2024-11-19 00:34:27,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:34:27,089 INFO L225 Difference]: With dead ends: 524 [2024-11-19 00:34:27,090 INFO L226 Difference]: Without dead ends: 329 [2024-11-19 00:34:27,090 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 95 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-19 00:34:27,090 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 69 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:34:27,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 435 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:34:27,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2024-11-19 00:34:27,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 186. [2024-11-19 00:34:27,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 159 states have (on average 1.2578616352201257) internal successors, (200), 160 states have internal predecessors, (200), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-19 00:34:27,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 240 transitions. [2024-11-19 00:34:27,101 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 240 transitions. Word has length 99 [2024-11-19 00:34:27,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:34:27,102 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 240 transitions. [2024-11-19 00:34:27,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:34:27,102 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 240 transitions. [2024-11-19 00:34:27,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-19 00:34:27,102 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:34:27,102 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:34:27,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-19 00:34:27,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:34:27,303 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:34:27,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:34:27,304 INFO L85 PathProgramCache]: Analyzing trace with hash -2001270962, now seen corresponding path program 1 times [2024-11-19 00:34:27,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:34:27,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [106788123] [2024-11-19 00:34:27,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:34:27,310 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:34:27,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:34:27,312 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:34:27,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-19 00:34:27,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:34:27,527 INFO L255 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-19 00:34:27,530 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:34:27,555 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 9 treesize of output 3 [2024-11-19 00:34:27,722 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-19 00:34:27,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-11-19 00:34:28,046 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:34:28,046 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 45 treesize of output 26 [2024-11-19 00:34:28,216 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:34:28,217 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 79 treesize of output 63 [2024-11-19 00:34:28,224 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 60 treesize of output 42 [2024-11-19 00:34:28,367 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:34:28,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 37 [2024-11-19 00:34:28,405 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 108 proven. 9 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2024-11-19 00:34:28,405 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:34:29,445 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-19 00:34:29,445 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:34:29,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [106788123] [2024-11-19 00:34:29,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [106788123] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 00:34:29,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:34:29,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [13] total 19 [2024-11-19 00:34:29,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148101669] [2024-11-19 00:34:29,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:34:29,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 00:34:29,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:34:29,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 00:34:29,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2024-11-19 00:34:29,448 INFO L87 Difference]: Start difference. First operand 186 states and 240 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:34:34,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-19 00:34:38,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-19 00:34:42,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-19 00:34:46,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-19 00:34:50,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-19 00:34:54,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 00:34:58,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-19 00:35:02,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-19 00:35:03,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:35:03,131 INFO L93 Difference]: Finished difference Result 438 states and 562 transitions. [2024-11-19 00:35:03,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:35:03,133 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2024-11-19 00:35:03,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:35:03,135 INFO L225 Difference]: With dead ends: 438 [2024-11-19 00:35:03,135 INFO L226 Difference]: Without dead ends: 255 [2024-11-19 00:35:03,135 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2024-11-19 00:35:03,136 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 158 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:35:03,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 569 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 8 Unknown, 0 Unchecked, 33.4s Time] [2024-11-19 00:35:03,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-11-19 00:35:03,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 208. [2024-11-19 00:35:03,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 181 states have (on average 1.2486187845303867) internal successors, (226), 182 states have internal predecessors, (226), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-19 00:35:03,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 266 transitions. [2024-11-19 00:35:03,150 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 266 transitions. Word has length 99 [2024-11-19 00:35:03,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:35:03,151 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 266 transitions. [2024-11-19 00:35:03,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:35:03,151 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 266 transitions. [2024-11-19 00:35:03,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-19 00:35:03,152 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:35:03,152 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:35:03,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-19 00:35:03,352 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-19 00:35:03,353 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:35:03,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:35:03,353 INFO L85 PathProgramCache]: Analyzing trace with hash 325744351, now seen corresponding path program 1 times [2024-11-19 00:35:03,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:35:03,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [168702327] [2024-11-19 00:35:03,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:03,354 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:35:03,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:35:03,355 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-19 00:35:03,356 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-19 00:35:03,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:03,528 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 00:35:03,530 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:35:03,554 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-19 00:35:03,555 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:35:03,555 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:35:03,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [168702327] [2024-11-19 00:35:03,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [168702327] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:35:03,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:35:03,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:35:03,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152441641] [2024-11-19 00:35:03,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:35:03,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:35:03,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:35:03,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:35:03,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:35:03,558 INFO L87 Difference]: Start difference. First operand 208 states and 266 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:35:03,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:35:03,607 INFO L93 Difference]: Finished difference Result 416 states and 533 transitions. [2024-11-19 00:35:03,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:35:03,608 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 100 [2024-11-19 00:35:03,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:35:03,609 INFO L225 Difference]: With dead ends: 416 [2024-11-19 00:35:03,609 INFO L226 Difference]: Without dead ends: 211 [2024-11-19 00:35:03,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:35:03,610 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 0 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 522 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-19 00:35:03,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 522 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:35:03,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-19 00:35:03,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 208. [2024-11-19 00:35:03,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 181 states have (on average 1.2430939226519337) internal successors, (225), 182 states have internal predecessors, (225), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-19 00:35:03,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 265 transitions. [2024-11-19 00:35:03,630 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 265 transitions. Word has length 100 [2024-11-19 00:35:03,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:35:03,630 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 265 transitions. [2024-11-19 00:35:03,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:35:03,631 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 265 transitions. [2024-11-19 00:35:03,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-19 00:35:03,632 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:35:03,632 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:35:03,643 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-19 00:35:03,833 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-19 00:35:03,833 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:35:03,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:35:03,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1298355466, now seen corresponding path program 1 times [2024-11-19 00:35:03,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:35:03,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1276021098] [2024-11-19 00:35:03,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:03,834 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:35:03,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:35:03,835 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:35:03,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-19 00:35:04,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:04,039 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-19 00:35:04,042 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:35:04,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 00:35:04,483 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:35:04,483 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 188 treesize of output 98 [2024-11-19 00:35:04,801 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:35:04,801 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 384 treesize of output 134 [2024-11-19 00:35:04,881 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-11-19 00:35:04,881 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:35:05,138 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:35:05,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1276021098] [2024-11-19 00:35:05,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1276021098] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:35:05,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [53449110] [2024-11-19 00:35:05,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:05,139 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 00:35:05,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 00:35:05,141 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-19 00:35:05,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2024-11-19 00:35:05,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:05,890 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-19 00:35:05,894 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:35:06,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-11-19 00:35:07,096 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:35:07,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 166 treesize of output 100 [2024-11-19 00:35:07,630 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:35:07,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 299 treesize of output 151 [2024-11-19 00:35:07,655 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-11-19 00:35:07,655 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:35:07,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [53449110] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:35:07,801 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 00:35:07,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2024-11-19 00:35:07,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349984337] [2024-11-19 00:35:07,801 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 00:35:07,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-19 00:35:07,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:35:07,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-19 00:35:07,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2024-11-19 00:35:07,802 INFO L87 Difference]: Start difference. First operand 208 states and 265 transitions. Second operand has 18 states, 18 states have (on average 5.388888888888889) internal successors, (97), 17 states have internal predecessors, (97), 4 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2024-11-19 00:35:11,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:35:11,007 INFO L93 Difference]: Finished difference Result 542 states and 681 transitions. [2024-11-19 00:35:11,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 00:35:11,008 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.388888888888889) internal successors, (97), 17 states have internal predecessors, (97), 4 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) Word has length 100 [2024-11-19 00:35:11,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:35:11,010 INFO L225 Difference]: With dead ends: 542 [2024-11-19 00:35:11,010 INFO L226 Difference]: Without dead ends: 540 [2024-11-19 00:35:11,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 232 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=167, Invalid=825, Unknown=0, NotChecked=0, Total=992 [2024-11-19 00:35:11,010 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 650 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 650 SdHoareTripleChecker+Valid, 1004 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-19 00:35:11,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [650 Valid, 1004 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-19 00:35:11,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2024-11-19 00:35:11,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 532. [2024-11-19 00:35:11,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 467 states have (on average 1.2334047109207709) internal successors, (576), 473 states have internal predecessors, (576), 48 states have call successors, (48), 16 states have call predecessors, (48), 16 states have return successors, (48), 42 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-19 00:35:11,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 672 transitions. [2024-11-19 00:35:11,046 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 672 transitions. Word has length 100 [2024-11-19 00:35:11,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:35:11,047 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 672 transitions. [2024-11-19 00:35:11,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.388888888888889) internal successors, (97), 17 states have internal predecessors, (97), 4 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2024-11-19 00:35:11,047 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 672 transitions. [2024-11-19 00:35:11,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-19 00:35:11,048 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:35:11,048 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:35:11,059 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Ended with exit code 0 [2024-11-19 00:35:11,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2024-11-19 00:35:11,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:35:11,450 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:35:11,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:35:11,450 INFO L85 PathProgramCache]: Analyzing trace with hash 2029261176, now seen corresponding path program 1 times [2024-11-19 00:35:11,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:35:11,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1104470069] [2024-11-19 00:35:11,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:11,450 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:35:11,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:35:11,453 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:35:11,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-19 00:35:11,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:11,615 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 00:35:11,617 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:35:11,624 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-11-19 00:35:11,624 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:35:11,624 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:35:11,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1104470069] [2024-11-19 00:35:11,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1104470069] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:35:11,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:35:11,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:35:11,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169031684] [2024-11-19 00:35:11,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:35:11,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:35:11,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:35:11,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:35:11,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:35:11,625 INFO L87 Difference]: Start difference. First operand 532 states and 672 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 00:35:11,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:35:11,688 INFO L93 Difference]: Finished difference Result 1061 states and 1341 transitions. [2024-11-19 00:35:11,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:35:11,689 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 100 [2024-11-19 00:35:11,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:35:11,691 INFO L225 Difference]: With dead ends: 1061 [2024-11-19 00:35:11,691 INFO L226 Difference]: Without dead ends: 532 [2024-11-19 00:35:11,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:35:11,692 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 0 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:35:11,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 316 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:35:11,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2024-11-19 00:35:11,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 532. [2024-11-19 00:35:11,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 467 states have (on average 1.2291220556745182) internal successors, (574), 473 states have internal predecessors, (574), 48 states have call successors, (48), 16 states have call predecessors, (48), 16 states have return successors, (48), 42 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-19 00:35:11,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 670 transitions. [2024-11-19 00:35:11,738 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 670 transitions. Word has length 100 [2024-11-19 00:35:11,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:35:11,738 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 670 transitions. [2024-11-19 00:35:11,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 00:35:11,738 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 670 transitions. [2024-11-19 00:35:11,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-19 00:35:11,740 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:35:11,740 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:35:11,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-11-19 00:35:11,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:35:11,941 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:35:11,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:35:11,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1665814440, now seen corresponding path program 1 times [2024-11-19 00:35:11,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:35:11,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1868299043] [2024-11-19 00:35:11,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:11,942 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:35:11,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:35:11,945 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:35:11,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-11-19 00:35:12,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:12,170 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-19 00:35:12,173 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:35:12,183 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 9 treesize of output 3 [2024-11-19 00:35:12,231 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-19 00:35:12,411 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:35:12,411 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 45 treesize of output 26 [2024-11-19 00:35:12,449 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 32 treesize of output 26 [2024-11-19 00:35:12,456 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:35:12,456 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 52 treesize of output 42 [2024-11-19 00:35:12,765 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:35:12,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 40 [2024-11-19 00:35:12,792 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 108 proven. 9 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2024-11-19 00:35:12,792 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:35:13,372 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-19 00:35:13,372 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:35:13,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1868299043] [2024-11-19 00:35:13,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1868299043] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 00:35:13,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:35:13,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 15 [2024-11-19 00:35:13,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081499931] [2024-11-19 00:35:13,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:35:13,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:35:13,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:35:13,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:35:13,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-11-19 00:35:13,373 INFO L87 Difference]: Start difference. First operand 532 states and 670 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:35:17,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 00:35:21,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 00:35:22,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:35:22,322 INFO L93 Difference]: Finished difference Result 1145 states and 1438 transitions. [2024-11-19 00:35:22,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:35:22,329 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 101 [2024-11-19 00:35:22,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:35:22,331 INFO L225 Difference]: With dead ends: 1145 [2024-11-19 00:35:22,331 INFO L226 Difference]: Without dead ends: 616 [2024-11-19 00:35:22,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-11-19 00:35:22,334 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 40 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2024-11-19 00:35:22,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 459 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 2 Unknown, 0 Unchecked, 8.8s Time] [2024-11-19 00:35:22,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2024-11-19 00:35:22,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 515. [2024-11-19 00:35:22,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 450 states have (on average 1.22) internal successors, (549), 456 states have internal predecessors, (549), 48 states have call successors, (48), 16 states have call predecessors, (48), 16 states have return successors, (48), 42 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-19 00:35:22,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 645 transitions. [2024-11-19 00:35:22,376 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 645 transitions. Word has length 101 [2024-11-19 00:35:22,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:35:22,376 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 645 transitions. [2024-11-19 00:35:22,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:35:22,377 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 645 transitions. [2024-11-19 00:35:22,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-19 00:35:22,378 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:35:22,379 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:35:22,388 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 (21)] Forceful destruction successful, exit code 0 [2024-11-19 00:35:22,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:35:22,579 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:35:22,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:35:22,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1855279878, now seen corresponding path program 1 times [2024-11-19 00:35:22,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:35:22,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [208413125] [2024-11-19 00:35:22,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:22,581 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:35:22,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:35:22,582 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:35:22,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-11-19 00:35:22,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:22,779 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 00:35:22,781 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:35:22,805 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-19 00:35:22,806 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:35:22,806 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:35:22,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [208413125] [2024-11-19 00:35:22,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [208413125] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:35:22,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:35:22,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:35:22,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719179563] [2024-11-19 00:35:22,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:35:22,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:35:22,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:35:22,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:35:22,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:35:22,808 INFO L87 Difference]: Start difference. First operand 515 states and 645 transitions. Second operand has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-19 00:35:22,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:35:22,932 INFO L93 Difference]: Finished difference Result 1059 states and 1321 transitions. [2024-11-19 00:35:22,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:35:22,933 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 102 [2024-11-19 00:35:22,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:35:22,935 INFO L225 Difference]: With dead ends: 1059 [2024-11-19 00:35:22,935 INFO L226 Difference]: Without dead ends: 543 [2024-11-19 00:35:22,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:35:22,936 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 1 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:35:22,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 448 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:35:22,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2024-11-19 00:35:22,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 515. [2024-11-19 00:35:22,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 450 states have (on average 1.2155555555555555) internal successors, (547), 456 states have internal predecessors, (547), 48 states have call successors, (48), 16 states have call predecessors, (48), 16 states have return successors, (48), 42 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-19 00:35:22,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 643 transitions. [2024-11-19 00:35:22,977 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 643 transitions. Word has length 102 [2024-11-19 00:35:22,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:35:22,977 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 643 transitions. [2024-11-19 00:35:22,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-19 00:35:22,977 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 643 transitions. [2024-11-19 00:35:22,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-19 00:35:22,978 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:35:22,978 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:35:22,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2024-11-19 00:35:23,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:35:23,179 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:35:23,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:35:23,179 INFO L85 PathProgramCache]: Analyzing trace with hash 531229628, now seen corresponding path program 1 times [2024-11-19 00:35:23,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:35:23,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2094705321] [2024-11-19 00:35:23,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:23,180 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:35:23,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:35:23,181 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:35:23,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-11-19 00:35:23,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:23,463 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-19 00:35:23,466 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:35:23,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 00:35:24,007 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:35:24,008 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 186 treesize of output 96 [2024-11-19 00:35:24,309 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:35:24,312 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 382 treesize of output 132 [2024-11-19 00:35:24,403 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 6 proven. 130 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-19 00:35:24,403 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:35:24,730 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:35:24,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2094705321] [2024-11-19 00:35:24,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2094705321] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:35:24,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1993800536] [2024-11-19 00:35:24,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:24,731 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 00:35:24,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 00:35:24,733 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-19 00:35:24,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2024-11-19 00:35:25,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:25,594 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-19 00:35:25,598 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:35:25,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-11-19 00:35:32,240 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:35:32,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 164 treesize of output 98 [2024-11-19 00:35:32,773 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:35:32,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 193 treesize of output 81 [2024-11-19 00:35:32,793 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 6 proven. 130 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-19 00:35:32,794 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:35:32,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1993800536] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:35:32,921 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 00:35:32,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 24 [2024-11-19 00:35:32,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353003865] [2024-11-19 00:35:32,921 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 00:35:32,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-19 00:35:32,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:35:32,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-19 00:35:32,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=756, Unknown=1, NotChecked=0, Total=870 [2024-11-19 00:35:32,922 INFO L87 Difference]: Start difference. First operand 515 states and 643 transitions. Second operand has 25 states, 23 states have (on average 4.6521739130434785) internal successors, (107), 22 states have internal predecessors, (107), 6 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 4 states have call predecessors, (22), 6 states have call successors, (22)