./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-57.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-57.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 523cdc555ae18a7121d858cb3ce401c3fbc4c545022234654bee429dbd299e9d --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:32:52,603 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:32:52,683 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 01:32:52,686 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:32:52,687 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:32:52,715 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:32:52,716 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:32:52,716 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:32:52,717 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:32:52,717 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:32:52,718 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:32:52,718 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:32:52,719 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:32:52,719 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:32:52,721 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:32:52,721 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:32:52,722 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:32:52,722 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:32:52,722 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 01:32:52,722 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:32:52,723 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:32:52,723 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:32:52,726 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:32:52,727 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:32:52,727 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:32:52,727 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:32:52,727 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:32:52,727 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:32:52,728 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:32:52,728 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:32:52,728 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:32:52,728 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:32:52,728 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:32:52,729 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:32:52,729 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:32:52,729 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:32:52,729 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 01:32:52,729 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 01:32:52,729 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:32:52,730 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:32:52,730 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:32:52,731 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:32:52,731 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 -> 523cdc555ae18a7121d858cb3ce401c3fbc4c545022234654bee429dbd299e9d [2024-11-09 01:32:52,957 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:32:52,984 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:32:52,989 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:32:52,990 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:32:52,991 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:32:52,991 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-57.i [2024-11-09 01:32:54,409 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:32:54,762 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:32:54,765 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-57.i [2024-11-09 01:32:54,779 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/147775940/a54309601d234216995e7e7565c891aa/FLAGc9f017dbc [2024-11-09 01:32:55,044 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/147775940/a54309601d234216995e7e7565c891aa [2024-11-09 01:32:55,046 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:32:55,047 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:32:55,052 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:32:55,053 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:32:55,057 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:32:55,061 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:32:55" (1/1) ... [2024-11-09 01:32:55,063 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e070f6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:32:55, skipping insertion in model container [2024-11-09 01:32:55,063 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:32:55" (1/1) ... [2024-11-09 01:32:55,104 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:32:55,349 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-57.i[916,929] [2024-11-09 01:32:55,435 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:32:55,443 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:32:55,451 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-57.i[916,929] [2024-11-09 01:32:55,501 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:32:55,524 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:32:55,526 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:32:55 WrapperNode [2024-11-09 01:32:55,526 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:32:55,527 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:32:55,528 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:32:55,528 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:32:55,533 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:32:55" (1/1) ... [2024-11-09 01:32:55,545 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:32:55" (1/1) ... [2024-11-09 01:32:55,591 INFO L138 Inliner]: procedures = 29, calls = 143, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 418 [2024-11-09 01:32:55,591 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:32:55,592 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:32:55,592 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:32:55,592 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:32:55,603 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:32:55" (1/1) ... [2024-11-09 01:32:55,605 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:32:55" (1/1) ... [2024-11-09 01:32:55,609 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:32:55" (1/1) ... [2024-11-09 01:32:55,644 INFO L175 MemorySlicer]: Split 110 memory accesses to 5 slices as follows [2, 24, 3, 72, 9]. 65 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 3, 1, 8, 1]. The 17 writes are split as follows [0, 3, 1, 10, 3]. [2024-11-09 01:32:55,645 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:32:55" (1/1) ... [2024-11-09 01:32:55,645 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:32:55" (1/1) ... [2024-11-09 01:32:55,664 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:32:55" (1/1) ... [2024-11-09 01:32:55,671 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:32:55" (1/1) ... [2024-11-09 01:32:55,676 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:32:55" (1/1) ... [2024-11-09 01:32:55,681 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:32:55" (1/1) ... [2024-11-09 01:32:55,685 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:32:55,689 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:32:55,689 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:32:55,689 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:32:55,689 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:32:55" (1/1) ... [2024-11-09 01:32:55,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:32:55,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:32:55,726 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 01:32:55,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 01:32:55,773 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:32:55,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-09 01:32:55,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-09 01:32:55,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-09 01:32:55,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-09 01:32:55,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-09 01:32:55,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 01:32:55,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 01:32:55,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 01:32:55,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-09 01:32:55,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-09 01:32:55,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-09 01:32:55,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-09 01:32:55,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-09 01:32:55,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-09 01:32:55,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-09 01:32:55,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 01:32:55,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 01:32:55,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 01:32:55,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-09 01:32:55,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-09 01:32:55,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-09 01:32:55,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-09 01:32:55,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-09 01:32:55,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-09 01:32:55,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-09 01:32:55,780 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:32:55,781 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:32:55,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 01:32:55,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 01:32:55,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 01:32:55,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-09 01:32:55,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-09 01:32:55,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:32:55,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:32:55,923 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:32:55,925 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:32:56,277 INFO L? ?]: Removed 94 outVars from TransFormulas that were not future-live. [2024-11-09 01:32:56,277 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:32:56,287 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:32:56,287 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:32:56,288 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:32:56 BoogieIcfgContainer [2024-11-09 01:32:56,288 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:32:56,289 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:32:56,289 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:32:56,291 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:32:56,292 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:32:55" (1/3) ... [2024-11-09 01:32:56,292 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ee58210 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:32:56, skipping insertion in model container [2024-11-09 01:32:56,292 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:32:55" (2/3) ... [2024-11-09 01:32:56,292 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ee58210 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:32:56, skipping insertion in model container [2024-11-09 01:32:56,292 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:32:56" (3/3) ... [2024-11-09 01:32:56,293 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-57.i [2024-11-09 01:32:56,330 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:32:56,330 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:32:56,412 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:32:56,419 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;@2bca7fe9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:32:56,420 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:32:56,423 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 76 states have (on average 1.394736842105263) internal successors, (106), 77 states have internal predecessors, (106), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 01:32:56,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-09 01:32:56,436 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:32:56,437 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:32:56,438 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:32:56,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:32:56,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1840313941, now seen corresponding path program 1 times [2024-11-09 01:32:56,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:32:56,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604227269] [2024-11-09 01:32:56,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:32:56,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:32:56,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:56,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:32:56,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:56,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:32:56,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:56,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:32:56,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:56,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:32:56,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:56,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:32:56,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:56,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:32:56,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:56,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:32:56,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:56,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:32:56,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:56,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:32:56,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:56,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:32:56,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:56,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:32:56,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:56,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:32:56,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:56,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:32:56,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:56,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:32:56,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:56,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:32:56,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:56,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:32:56,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:56,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:32:56,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:56,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:32:56,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:56,796 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:32:56,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:32:56,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604227269] [2024-11-09 01:32:56,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604227269] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:32:56,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:32:56,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:32:56,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748675891] [2024-11-09 01:32:56,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:32:56,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:32:56,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:32:56,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:32:56,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:32:56,822 INFO L87 Difference]: Start difference. First operand has 97 states, 76 states have (on average 1.394736842105263) internal successors, (106), 77 states have internal predecessors, (106), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-09 01:32:56,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:32:56,850 INFO L93 Difference]: Finished difference Result 187 states and 296 transitions. [2024-11-09 01:32:56,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:32:56,854 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 134 [2024-11-09 01:32:56,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:32:56,860 INFO L225 Difference]: With dead ends: 187 [2024-11-09 01:32:56,860 INFO L226 Difference]: Without dead ends: 93 [2024-11-09 01:32:56,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:32:56,868 INFO L432 NwaCegarLoop]: 135 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, 135 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:32:56,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:32:56,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-09 01:32:56,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-09 01:32:56,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 73 states have (on average 1.356164383561644) internal successors, (99), 73 states have internal predecessors, (99), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 01:32:56,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 135 transitions. [2024-11-09 01:32:56,902 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 135 transitions. Word has length 134 [2024-11-09 01:32:56,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:32:56,902 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 135 transitions. [2024-11-09 01:32:56,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-09 01:32:56,903 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 135 transitions. [2024-11-09 01:32:56,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-09 01:32:56,905 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:32:56,906 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:32:56,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 01:32:56,906 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:32:56,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:32:56,907 INFO L85 PathProgramCache]: Analyzing trace with hash -957014791, now seen corresponding path program 1 times [2024-11-09 01:32:56,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:32:56,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254468979] [2024-11-09 01:32:56,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:32:56,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:32:56,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:57,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:32:57,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:57,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:32:57,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:57,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:32:57,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:57,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:32:57,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:57,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:32:57,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:57,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:32:57,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:57,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:32:57,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:57,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:32:57,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:57,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:32:57,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:57,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:32:57,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:57,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:32:57,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:57,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:32:57,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:57,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:32:57,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:57,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:32:57,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:57,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:32:57,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:57,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:32:57,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:57,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:32:57,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:57,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:32:57,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:57,186 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:32:57,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:32:57,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254468979] [2024-11-09 01:32:57,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254468979] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:32:57,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:32:57,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:32:57,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139466378] [2024-11-09 01:32:57,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:32:57,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:32:57,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:32:57,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:32:57,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:32:57,193 INFO L87 Difference]: Start difference. First operand 93 states and 135 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:32:57,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:32:57,245 INFO L93 Difference]: Finished difference Result 186 states and 271 transitions. [2024-11-09 01:32:57,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:32:57,246 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 134 [2024-11-09 01:32:57,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:32:57,247 INFO L225 Difference]: With dead ends: 186 [2024-11-09 01:32:57,248 INFO L226 Difference]: Without dead ends: 96 [2024-11-09 01:32:57,248 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:32:57,249 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 1 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:32:57,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 387 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:32:57,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-09 01:32:57,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2024-11-09 01:32:57,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 75 states have (on average 1.3466666666666667) internal successors, (101), 75 states have internal predecessors, (101), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 01:32:57,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 137 transitions. [2024-11-09 01:32:57,268 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 137 transitions. Word has length 134 [2024-11-09 01:32:57,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:32:57,271 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 137 transitions. [2024-11-09 01:32:57,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:32:57,271 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 137 transitions. [2024-11-09 01:32:57,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-09 01:32:57,274 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:32:57,274 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:32:57,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 01:32:57,274 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:32:57,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:32:57,275 INFO L85 PathProgramCache]: Analyzing trace with hash -955167749, now seen corresponding path program 1 times [2024-11-09 01:32:57,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:32:57,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999557711] [2024-11-09 01:32:57,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:32:57,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:32:57,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:57,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:32:57,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:57,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:32:57,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:57,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:32:57,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:57,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:32:57,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:57,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:32:57,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:57,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:32:57,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:57,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:32:57,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:57,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:32:57,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:57,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:32:57,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:57,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:32:57,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:57,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:32:57,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:57,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:32:57,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:57,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:32:57,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:57,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:32:57,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:57,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:32:57,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:57,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:32:57,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:57,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:32:57,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:57,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:32:57,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:57,696 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:32:57,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:32:57,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999557711] [2024-11-09 01:32:57,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999557711] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:32:57,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:32:57,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:32:57,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896105809] [2024-11-09 01:32:57,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:32:57,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:32:57,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:32:57,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:32:57,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:32:57,700 INFO L87 Difference]: Start difference. First operand 95 states and 137 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:32:57,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:32:57,795 INFO L93 Difference]: Finished difference Result 236 states and 343 transitions. [2024-11-09 01:32:57,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:32:57,798 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 134 [2024-11-09 01:32:57,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:32:57,800 INFO L225 Difference]: With dead ends: 236 [2024-11-09 01:32:57,800 INFO L226 Difference]: Without dead ends: 144 [2024-11-09 01:32:57,801 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:32:57,804 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 60 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:32:57,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 554 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:32:57,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-09 01:32:57,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 111. [2024-11-09 01:32:57,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 91 states have (on average 1.3736263736263736) internal successors, (125), 91 states have internal predecessors, (125), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 01:32:57,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 161 transitions. [2024-11-09 01:32:57,820 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 161 transitions. Word has length 134 [2024-11-09 01:32:57,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:32:57,821 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 161 transitions. [2024-11-09 01:32:57,821 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:32:57,821 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 161 transitions. [2024-11-09 01:32:57,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-09 01:32:57,823 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:32:57,823 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:32:57,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 01:32:57,824 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:32:57,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:32:57,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1223337891, now seen corresponding path program 1 times [2024-11-09 01:32:57,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:32:57,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016158874] [2024-11-09 01:32:57,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:32:57,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:32:57,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:57,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:32:57,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:57,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:32:57,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:57,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:32:57,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:57,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:32:57,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:57,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:32:57,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:57,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:32:57,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:57,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:32:57,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:57,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:32:57,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:57,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:32:57,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:57,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:32:57,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:57,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:32:57,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:57,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:32:57,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:57,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:32:57,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:57,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:32:57,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:57,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:32:57,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:57,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:32:57,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:57,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:32:57,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:57,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:32:57,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:57,962 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:32:57,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:32:57,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016158874] [2024-11-09 01:32:57,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016158874] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:32:57,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:32:57,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:32:57,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782218566] [2024-11-09 01:32:57,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:32:57,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:32:57,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:32:57,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:32:57,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:32:57,965 INFO L87 Difference]: Start difference. First operand 111 states and 161 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:32:57,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:32:57,989 INFO L93 Difference]: Finished difference Result 259 states and 377 transitions. [2024-11-09 01:32:57,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:32:57,989 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 136 [2024-11-09 01:32:57,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:32:57,993 INFO L225 Difference]: With dead ends: 259 [2024-11-09 01:32:57,994 INFO L226 Difference]: Without dead ends: 151 [2024-11-09 01:32:57,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 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-09 01:32:57,995 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 60 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:32:57,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 300 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:32:57,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-09 01:32:58,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 111. [2024-11-09 01:32:58,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 91 states have (on average 1.3626373626373627) internal successors, (124), 91 states have internal predecessors, (124), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 01:32:58,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 160 transitions. [2024-11-09 01:32:58,007 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 160 transitions. Word has length 136 [2024-11-09 01:32:58,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:32:58,008 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 160 transitions. [2024-11-09 01:32:58,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:32:58,008 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 160 transitions. [2024-11-09 01:32:58,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-09 01:32:58,010 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:32:58,010 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:32:58,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 01:32:58,011 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:32:58,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:32:58,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1896205134, now seen corresponding path program 1 times [2024-11-09 01:32:58,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:32:58,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858540630] [2024-11-09 01:32:58,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:32:58,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:32:58,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:58,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:32:58,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:58,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:32:58,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:58,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:32:58,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:58,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:32:58,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:58,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:32:58,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:58,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:32:58,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:58,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:32:58,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:58,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:32:58,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:58,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:32:58,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:58,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:32:58,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:58,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:32:58,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:58,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:32:58,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:58,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:32:58,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:58,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:32:58,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:58,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:32:58,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:58,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:32:58,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:58,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:32:58,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:58,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:32:58,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:58,314 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:32:58,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:32:58,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858540630] [2024-11-09 01:32:58,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858540630] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:32:58,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:32:58,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:32:58,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926100738] [2024-11-09 01:32:58,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:32:58,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:32:58,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:32:58,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:32:58,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:32:58,319 INFO L87 Difference]: Start difference. First operand 111 states and 160 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-09 01:32:58,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:32:58,672 INFO L93 Difference]: Finished difference Result 312 states and 451 transitions. [2024-11-09 01:32:58,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:32:58,673 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 137 [2024-11-09 01:32:58,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:32:58,675 INFO L225 Difference]: With dead ends: 312 [2024-11-09 01:32:58,675 INFO L226 Difference]: Without dead ends: 204 [2024-11-09 01:32:58,675 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:32:58,676 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 113 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:32:58,676 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 408 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:32:58,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-09 01:32:58,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 155. [2024-11-09 01:32:58,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 116 states have (on average 1.2844827586206897) internal successors, (149), 116 states have internal predecessors, (149), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-09 01:32:58,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 221 transitions. [2024-11-09 01:32:58,701 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 221 transitions. Word has length 137 [2024-11-09 01:32:58,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:32:58,702 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 221 transitions. [2024-11-09 01:32:58,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-09 01:32:58,702 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 221 transitions. [2024-11-09 01:32:58,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-09 01:32:58,704 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:32:58,704 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:32:58,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 01:32:58,704 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:32:58,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:32:58,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1705869233, now seen corresponding path program 1 times [2024-11-09 01:32:58,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:32:58,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998414673] [2024-11-09 01:32:58,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:32:58,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:32:58,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:58,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:32:58,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:58,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:32:58,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:58,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:32:58,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:58,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:32:58,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:58,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:32:58,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:58,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:32:58,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:58,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:32:58,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:58,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:32:58,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:58,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:32:58,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:58,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:32:58,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:58,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:32:58,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:58,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:32:58,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:58,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:32:58,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:58,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:32:58,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:58,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:32:58,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:58,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:32:58,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:58,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:32:58,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:58,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:32:58,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:58,997 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:32:58,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:32:58,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998414673] [2024-11-09 01:32:58,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998414673] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:32:58,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:32:58,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:32:58,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912982684] [2024-11-09 01:32:58,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:32:59,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:32:59,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:32:59,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:32:59,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:32:59,001 INFO L87 Difference]: Start difference. First operand 155 states and 221 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:32:59,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:32:59,091 INFO L93 Difference]: Finished difference Result 313 states and 450 transitions. [2024-11-09 01:32:59,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:32:59,091 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 141 [2024-11-09 01:32:59,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:32:59,093 INFO L225 Difference]: With dead ends: 313 [2024-11-09 01:32:59,093 INFO L226 Difference]: Without dead ends: 205 [2024-11-09 01:32:59,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:32:59,095 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 56 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:32:59,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 622 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:32:59,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-09 01:32:59,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 174. [2024-11-09 01:32:59,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 135 states have (on average 1.3185185185185184) internal successors, (178), 135 states have internal predecessors, (178), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-09 01:32:59,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 250 transitions. [2024-11-09 01:32:59,108 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 250 transitions. Word has length 141 [2024-11-09 01:32:59,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:32:59,109 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 250 transitions. [2024-11-09 01:32:59,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:32:59,109 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 250 transitions. [2024-11-09 01:32:59,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-09 01:32:59,110 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:32:59,110 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:32:59,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 01:32:59,110 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:32:59,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:32:59,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1447703795, now seen corresponding path program 1 times [2024-11-09 01:32:59,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:32:59,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334981895] [2024-11-09 01:32:59,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:32:59,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:32:59,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:59,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:32:59,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:59,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:32:59,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:59,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:32:59,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:59,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:32:59,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:59,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:32:59,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:59,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:32:59,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:59,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:32:59,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:59,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:32:59,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:59,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:32:59,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:59,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:32:59,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:59,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:32:59,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:59,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:32:59,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:59,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:32:59,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:59,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:32:59,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:59,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:32:59,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:59,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:32:59,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:59,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:32:59,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:59,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:32:59,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:59,658 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:32:59,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:32:59,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334981895] [2024-11-09 01:32:59,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334981895] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:32:59,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:32:59,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 01:32:59,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306630361] [2024-11-09 01:32:59,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:32:59,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 01:32:59,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:32:59,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 01:32:59,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:32:59,659 INFO L87 Difference]: Start difference. First operand 174 states and 250 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:32:59,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:32:59,759 INFO L93 Difference]: Finished difference Result 329 states and 474 transitions. [2024-11-09 01:32:59,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 01:32:59,759 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 141 [2024-11-09 01:32:59,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:32:59,761 INFO L225 Difference]: With dead ends: 329 [2024-11-09 01:32:59,761 INFO L226 Difference]: Without dead ends: 202 [2024-11-09 01:32:59,762 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-11-09 01:32:59,762 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 169 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:32:59,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 658 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:32:59,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-11-09 01:32:59,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 153. [2024-11-09 01:32:59,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 114 states have (on average 1.280701754385965) internal successors, (146), 114 states have internal predecessors, (146), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-09 01:32:59,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 218 transitions. [2024-11-09 01:32:59,786 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 218 transitions. Word has length 141 [2024-11-09 01:32:59,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:32:59,786 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 218 transitions. [2024-11-09 01:32:59,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:32:59,786 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 218 transitions. [2024-11-09 01:32:59,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-09 01:32:59,791 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:32:59,791 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:32:59,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 01:32:59,791 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:32:59,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:32:59,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1643005562, now seen corresponding path program 1 times [2024-11-09 01:32:59,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:32:59,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912071357] [2024-11-09 01:32:59,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:32:59,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:32:59,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:00,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:33:00,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:00,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:33:00,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:00,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:33:00,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:00,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:33:00,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:00,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:33:00,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:00,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:33:00,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:00,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:33:00,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:00,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:33:00,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:00,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:33:00,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:00,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:33:00,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:00,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:33:00,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:00,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:33:00,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:00,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:33:00,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:00,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:33:00,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:00,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:33:00,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:00,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:33:00,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:00,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:33:00,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:00,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:33:00,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:00,520 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:33:00,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:33:00,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912071357] [2024-11-09 01:33:00,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912071357] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:33:00,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:33:00,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:33:00,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616379754] [2024-11-09 01:33:00,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:33:00,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:33:00,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:33:00,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:33:00,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:33:00,522 INFO L87 Difference]: Start difference. First operand 153 states and 218 transitions. Second operand has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-09 01:33:00,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:33:00,694 INFO L93 Difference]: Finished difference Result 321 states and 459 transitions. [2024-11-09 01:33:00,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:33:00,694 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 144 [2024-11-09 01:33:00,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:33:00,696 INFO L225 Difference]: With dead ends: 321 [2024-11-09 01:33:00,696 INFO L226 Difference]: Without dead ends: 215 [2024-11-09 01:33:00,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:33:00,696 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 75 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:33:00,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 602 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:33:00,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-09 01:33:00,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 212. [2024-11-09 01:33:00,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 168 states have (on average 1.3214285714285714) internal successors, (222), 169 states have internal predecessors, (222), 40 states have call successors, (40), 3 states have call predecessors, (40), 3 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-09 01:33:00,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 302 transitions. [2024-11-09 01:33:00,708 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 302 transitions. Word has length 144 [2024-11-09 01:33:00,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:33:00,709 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 302 transitions. [2024-11-09 01:33:00,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-09 01:33:00,709 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 302 transitions. [2024-11-09 01:33:00,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-09 01:33:00,710 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:33:00,710 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:33:00,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 01:33:00,710 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:33:00,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:33:00,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1861860280, now seen corresponding path program 1 times [2024-11-09 01:33:00,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:33:00,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654165991] [2024-11-09 01:33:00,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:00,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:33:00,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:01,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:33:01,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:01,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:33:01,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:01,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:33:01,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:01,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:33:01,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:01,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:33:01,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:01,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:33:01,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:01,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:33:01,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:01,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:33:01,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:01,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:33:01,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:01,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:33:01,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:01,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:33:01,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:01,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:33:01,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:01,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:33:01,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:01,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:33:01,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:01,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:33:01,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:01,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:33:01,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:01,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:33:01,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:01,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:33:01,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:01,035 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:33:01,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:33:01,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654165991] [2024-11-09 01:33:01,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654165991] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:33:01,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:33:01,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:33:01,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922353218] [2024-11-09 01:33:01,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:33:01,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:33:01,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:33:01,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:33:01,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:33:01,037 INFO L87 Difference]: Start difference. First operand 212 states and 302 transitions. Second operand has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-09 01:33:01,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:33:01,148 INFO L93 Difference]: Finished difference Result 381 states and 544 transitions. [2024-11-09 01:33:01,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:33:01,148 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 144 [2024-11-09 01:33:01,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:33:01,150 INFO L225 Difference]: With dead ends: 381 [2024-11-09 01:33:01,150 INFO L226 Difference]: Without dead ends: 216 [2024-11-09 01:33:01,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:33:01,151 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 64 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:33:01,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 601 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:33:01,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-11-09 01:33:01,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 213. [2024-11-09 01:33:01,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 169 states have (on average 1.319526627218935) internal successors, (223), 170 states have internal predecessors, (223), 40 states have call successors, (40), 3 states have call predecessors, (40), 3 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-09 01:33:01,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 303 transitions. [2024-11-09 01:33:01,161 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 303 transitions. Word has length 144 [2024-11-09 01:33:01,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:33:01,162 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 303 transitions. [2024-11-09 01:33:01,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-09 01:33:01,162 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 303 transitions. [2024-11-09 01:33:01,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-09 01:33:01,163 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:33:01,163 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:33:01,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 01:33:01,163 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:33:01,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:33:01,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1732042438, now seen corresponding path program 1 times [2024-11-09 01:33:01,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:33:01,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170925366] [2024-11-09 01:33:01,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:01,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:33:01,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:02,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:33:02,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:02,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:33:02,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:02,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:33:02,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:02,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:33:02,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:02,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:33:02,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:02,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:33:02,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:02,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:33:02,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:02,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:33:02,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:02,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:33:02,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:02,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:33:02,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:02,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:33:02,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:02,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:33:02,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:02,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:33:02,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:02,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:33:02,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:02,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:33:02,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:02,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:33:02,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:02,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:33:02,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:02,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:33:02,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:02,627 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:33:02,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:33:02,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170925366] [2024-11-09 01:33:02,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170925366] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:33:02,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:33:02,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:33:02,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555176241] [2024-11-09 01:33:02,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:33:02,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:33:02,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:33:02,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:33:02,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:33:02,630 INFO L87 Difference]: Start difference. First operand 213 states and 303 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:02,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:33:02,774 INFO L93 Difference]: Finished difference Result 485 states and 686 transitions. [2024-11-09 01:33:02,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:33:02,775 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 144 [2024-11-09 01:33:02,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:33:02,779 INFO L225 Difference]: With dead ends: 485 [2024-11-09 01:33:02,779 INFO L226 Difference]: Without dead ends: 319 [2024-11-09 01:33:02,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 45 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-09 01:33:02,780 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 61 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:33:02,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 676 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:33:02,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-11-09 01:33:02,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 316. [2024-11-09 01:33:02,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 260 states have (on average 1.3192307692307692) internal successors, (343), 263 states have internal predecessors, (343), 50 states have call successors, (50), 5 states have call predecessors, (50), 5 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-09 01:33:02,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 443 transitions. [2024-11-09 01:33:02,797 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 443 transitions. Word has length 144 [2024-11-09 01:33:02,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:33:02,799 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 443 transitions. [2024-11-09 01:33:02,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:02,800 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 443 transitions. [2024-11-09 01:33:02,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-09 01:33:02,801 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:33:02,801 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:33:02,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 01:33:02,802 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:33:02,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:33:02,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1952317151, now seen corresponding path program 1 times [2024-11-09 01:33:02,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:33:02,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054643414] [2024-11-09 01:33:02,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:02,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:33:02,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:02,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:33:02,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:02,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:33:02,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:02,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:33:02,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:02,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:33:02,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:02,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:33:02,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:02,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:33:02,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:02,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:33:02,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:02,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:33:02,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:02,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:33:02,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:02,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:33:02,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:02,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:33:02,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:02,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:33:02,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:02,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:33:02,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:02,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:33:02,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:02,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:33:02,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:02,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:33:02,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:02,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:33:02,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:02,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:33:02,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:02,969 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:33:02,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:33:02,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054643414] [2024-11-09 01:33:02,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054643414] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:33:02,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:33:02,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:33:02,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750646570] [2024-11-09 01:33:02,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:33:02,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:33:02,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:33:02,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:33:02,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:33:02,971 INFO L87 Difference]: Start difference. First operand 316 states and 443 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:03,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:33:03,054 INFO L93 Difference]: Finished difference Result 756 states and 1062 transitions. [2024-11-09 01:33:03,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:33:03,054 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2024-11-09 01:33:03,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:33:03,057 INFO L225 Difference]: With dead ends: 756 [2024-11-09 01:33:03,057 INFO L226 Difference]: Without dead ends: 487 [2024-11-09 01:33:03,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:33:03,058 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 81 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:33:03,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 530 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:33:03,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2024-11-09 01:33:03,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 337. [2024-11-09 01:33:03,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 281 states have (on average 1.3309608540925266) internal successors, (374), 284 states have internal predecessors, (374), 50 states have call successors, (50), 5 states have call predecessors, (50), 5 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-09 01:33:03,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 474 transitions. [2024-11-09 01:33:03,075 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 474 transitions. Word has length 145 [2024-11-09 01:33:03,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:33:03,076 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 474 transitions. [2024-11-09 01:33:03,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:03,076 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 474 transitions. [2024-11-09 01:33:03,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-09 01:33:03,078 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:33:03,078 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:33:03,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 01:33:03,078 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:33:03,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:33:03,079 INFO L85 PathProgramCache]: Analyzing trace with hash -566113757, now seen corresponding path program 1 times [2024-11-09 01:33:03,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:33:03,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405410901] [2024-11-09 01:33:03,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:03,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:33:03,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:03,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:33:03,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:03,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:33:03,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:03,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:33:03,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:03,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:33:03,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:03,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:33:03,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:03,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:33:03,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:03,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:33:03,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:03,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:33:03,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:03,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:33:03,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:03,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:33:03,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:03,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:33:03,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:03,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:33:03,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:03,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:33:03,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:03,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:33:03,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:03,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:33:03,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:03,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:33:03,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:03,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:33:03,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:03,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:33:03,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:03,287 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:33:03,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:33:03,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405410901] [2024-11-09 01:33:03,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405410901] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:33:03,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:33:03,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:33:03,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356181888] [2024-11-09 01:33:03,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:33:03,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:33:03,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:33:03,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:33:03,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:33:03,289 INFO L87 Difference]: Start difference. First operand 337 states and 474 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:03,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:33:03,381 INFO L93 Difference]: Finished difference Result 708 states and 997 transitions. [2024-11-09 01:33:03,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:33:03,382 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2024-11-09 01:33:03,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:33:03,384 INFO L225 Difference]: With dead ends: 708 [2024-11-09 01:33:03,384 INFO L226 Difference]: Without dead ends: 418 [2024-11-09 01:33:03,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:33:03,385 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 73 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:33:03,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 670 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:33:03,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2024-11-09 01:33:03,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 353. [2024-11-09 01:33:03,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 297 states have (on average 1.32996632996633) internal successors, (395), 300 states have internal predecessors, (395), 50 states have call successors, (50), 5 states have call predecessors, (50), 5 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-09 01:33:03,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 495 transitions. [2024-11-09 01:33:03,405 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 495 transitions. Word has length 145 [2024-11-09 01:33:03,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:33:03,405 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 495 transitions. [2024-11-09 01:33:03,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:03,406 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 495 transitions. [2024-11-09 01:33:03,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-09 01:33:03,407 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:33:03,407 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:33:03,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 01:33:03,407 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:33:03,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:33:03,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1845977435, now seen corresponding path program 1 times [2024-11-09 01:33:03,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:33:03,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370017446] [2024-11-09 01:33:03,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:03,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:33:03,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:03,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:33:03,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:03,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:33:03,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:03,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:33:03,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:03,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:33:03,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:03,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:33:03,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:03,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:33:03,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:03,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:33:03,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:03,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:33:03,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:03,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:33:03,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:03,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:33:03,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:03,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:33:03,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:03,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:33:03,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:03,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:33:03,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:03,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:33:03,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:03,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:33:03,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:03,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:33:03,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:03,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:33:03,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:03,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:33:03,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:03,632 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:33:03,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:33:03,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370017446] [2024-11-09 01:33:03,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370017446] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:33:03,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:33:03,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:33:03,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980798230] [2024-11-09 01:33:03,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:33:03,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:33:03,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:33:03,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:33:03,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:33:03,634 INFO L87 Difference]: Start difference. First operand 353 states and 495 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:03,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:33:03,715 INFO L93 Difference]: Finished difference Result 719 states and 1001 transitions. [2024-11-09 01:33:03,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:33:03,715 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2024-11-09 01:33:03,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:33:03,717 INFO L225 Difference]: With dead ends: 719 [2024-11-09 01:33:03,717 INFO L226 Difference]: Without dead ends: 413 [2024-11-09 01:33:03,717 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 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-09 01:33:03,718 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 52 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:33:03,718 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 541 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:33:03,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-11-09 01:33:03,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 410. [2024-11-09 01:33:03,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 349 states have (on average 1.320916905444126) internal successors, (461), 353 states have internal predecessors, (461), 52 states have call successors, (52), 8 states have call predecessors, (52), 8 states have return successors, (52), 48 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-09 01:33:03,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 565 transitions. [2024-11-09 01:33:03,734 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 565 transitions. Word has length 145 [2024-11-09 01:33:03,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:33:03,734 INFO L471 AbstractCegarLoop]: Abstraction has 410 states and 565 transitions. [2024-11-09 01:33:03,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:03,734 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 565 transitions. [2024-11-09 01:33:03,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-09 01:33:03,735 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:33:03,736 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:33:03,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 01:33:03,736 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:33:03,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:33:03,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1244546081, now seen corresponding path program 1 times [2024-11-09 01:33:03,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:33:03,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682478727] [2024-11-09 01:33:03,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:03,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:33:03,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:03,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:33:03,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:03,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:33:03,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:03,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:33:03,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:03,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:33:03,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:03,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:33:03,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:03,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:33:03,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:03,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:33:03,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:03,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:33:03,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:03,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:33:03,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:03,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:33:03,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:03,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:33:03,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:03,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:33:03,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:03,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:33:03,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:03,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:33:03,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:03,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:33:03,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:03,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:33:03,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:03,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:33:03,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:03,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:33:03,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:03,983 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:33:03,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:33:03,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682478727] [2024-11-09 01:33:03,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682478727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:33:03,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:33:03,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:33:03,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850857002] [2024-11-09 01:33:03,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:33:03,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:33:03,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:33:03,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:33:03,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:33:03,985 INFO L87 Difference]: Start difference. First operand 410 states and 565 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:04,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:33:04,115 INFO L93 Difference]: Finished difference Result 848 states and 1165 transitions. [2024-11-09 01:33:04,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 01:33:04,115 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2024-11-09 01:33:04,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:33:04,118 INFO L225 Difference]: With dead ends: 848 [2024-11-09 01:33:04,118 INFO L226 Difference]: Without dead ends: 485 [2024-11-09 01:33:04,118 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:33:04,119 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 103 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:33:04,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 593 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:33:04,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2024-11-09 01:33:04,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 417. [2024-11-09 01:33:04,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 356 states have (on average 1.3230337078651686) internal successors, (471), 360 states have internal predecessors, (471), 52 states have call successors, (52), 8 states have call predecessors, (52), 8 states have return successors, (52), 48 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-09 01:33:04,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 575 transitions. [2024-11-09 01:33:04,139 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 575 transitions. Word has length 145 [2024-11-09 01:33:04,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:33:04,140 INFO L471 AbstractCegarLoop]: Abstraction has 417 states and 575 transitions. [2024-11-09 01:33:04,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:04,140 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 575 transitions. [2024-11-09 01:33:04,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-09 01:33:04,142 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:33:04,142 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:33:04,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 01:33:04,142 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:33:04,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:33:04,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1770557537, now seen corresponding path program 1 times [2024-11-09 01:33:04,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:33:04,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806931659] [2024-11-09 01:33:04,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:04,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:33:04,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:04,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:33:04,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:04,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:33:04,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:04,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:33:04,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:04,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:33:04,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:04,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:33:04,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:04,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:33:04,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:04,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:33:04,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:04,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:33:04,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:04,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:33:04,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:04,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:33:04,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:04,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:33:04,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:04,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:33:04,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:04,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:33:04,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:04,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:33:04,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:04,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:33:04,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:04,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:33:04,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:04,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:33:04,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:04,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:33:04,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:04,424 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:33:04,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:33:04,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806931659] [2024-11-09 01:33:04,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806931659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:33:04,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:33:04,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:33:04,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204942962] [2024-11-09 01:33:04,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:33:04,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:33:04,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:33:04,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:33:04,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:33:04,426 INFO L87 Difference]: Start difference. First operand 417 states and 575 transitions. Second operand has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-09 01:33:04,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:33:04,532 INFO L93 Difference]: Finished difference Result 876 states and 1202 transitions. [2024-11-09 01:33:04,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:33:04,533 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 145 [2024-11-09 01:33:04,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:33:04,535 INFO L225 Difference]: With dead ends: 876 [2024-11-09 01:33:04,535 INFO L226 Difference]: Without dead ends: 506 [2024-11-09 01:33:04,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:33:04,536 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 133 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:33:04,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 599 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:33:04,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2024-11-09 01:33:04,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 455. [2024-11-09 01:33:04,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 390 states have (on average 1.3051282051282052) internal successors, (509), 395 states have internal predecessors, (509), 54 states have call successors, (54), 10 states have call predecessors, (54), 10 states have return successors, (54), 49 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-09 01:33:04,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 617 transitions. [2024-11-09 01:33:04,557 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 617 transitions. Word has length 145 [2024-11-09 01:33:04,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:33:04,557 INFO L471 AbstractCegarLoop]: Abstraction has 455 states and 617 transitions. [2024-11-09 01:33:04,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-09 01:33:04,558 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 617 transitions. [2024-11-09 01:33:04,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-09 01:33:04,559 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:33:04,559 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:33:04,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 01:33:04,559 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:33:04,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:33:04,560 INFO L85 PathProgramCache]: Analyzing trace with hash 205210215, now seen corresponding path program 1 times [2024-11-09 01:33:04,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:33:04,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273687554] [2024-11-09 01:33:04,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:04,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:33:04,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:04,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:33:04,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:04,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:33:04,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:04,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:33:04,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:04,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:33:04,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:04,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:33:04,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:04,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:33:04,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:04,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:33:04,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:04,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:33:04,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:04,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:33:04,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:04,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:33:04,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:04,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:33:04,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:04,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:33:04,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:04,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:33:04,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:04,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:33:04,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:04,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:33:04,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:04,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:33:04,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:04,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:33:04,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:04,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:33:04,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:04,624 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:33:04,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:33:04,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273687554] [2024-11-09 01:33:04,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273687554] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:33:04,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:33:04,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:33:04,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985661132] [2024-11-09 01:33:04,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:33:04,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:33:04,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:33:04,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:33:04,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:33:04,627 INFO L87 Difference]: Start difference. First operand 455 states and 617 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:04,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:33:04,651 INFO L93 Difference]: Finished difference Result 865 states and 1179 transitions. [2024-11-09 01:33:04,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:33:04,652 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2024-11-09 01:33:04,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:33:04,656 INFO L225 Difference]: With dead ends: 865 [2024-11-09 01:33:04,657 INFO L226 Difference]: Without dead ends: 461 [2024-11-09 01:33:04,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 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-09 01:33:04,658 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:33:04,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 259 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:33:04,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2024-11-09 01:33:04,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 461. [2024-11-09 01:33:04,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 396 states have (on average 1.3005050505050506) internal successors, (515), 401 states have internal predecessors, (515), 54 states have call successors, (54), 10 states have call predecessors, (54), 10 states have return successors, (54), 49 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-09 01:33:04,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 623 transitions. [2024-11-09 01:33:04,679 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 623 transitions. Word has length 147 [2024-11-09 01:33:04,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:33:04,679 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 623 transitions. [2024-11-09 01:33:04,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:04,680 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 623 transitions. [2024-11-09 01:33:04,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-09 01:33:04,680 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:33:04,681 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:33:04,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 01:33:04,681 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:33:04,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:33:04,681 INFO L85 PathProgramCache]: Analyzing trace with hash 463375653, now seen corresponding path program 1 times [2024-11-09 01:33:04,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:33:04,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973831854] [2024-11-09 01:33:04,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:04,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:33:04,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:04,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:33:04,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:04,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:33:04,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:04,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:33:04,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:04,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:33:04,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:04,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:33:04,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:04,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:33:04,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:04,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:33:04,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:04,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:33:04,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:04,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:33:04,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:04,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:33:04,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:04,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:33:04,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:04,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:33:04,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:04,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:33:04,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:04,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:33:04,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:04,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:33:04,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:04,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:33:04,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:04,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:33:04,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:04,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:33:04,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:04,864 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:33:04,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:33:04,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973831854] [2024-11-09 01:33:04,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973831854] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:33:04,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:33:04,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:33:04,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544499482] [2024-11-09 01:33:04,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:33:04,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:33:04,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:33:04,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:33:04,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:33:04,866 INFO L87 Difference]: Start difference. First operand 461 states and 623 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:04,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:33:04,937 INFO L93 Difference]: Finished difference Result 895 states and 1209 transitions. [2024-11-09 01:33:04,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:33:04,938 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2024-11-09 01:33:04,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:33:04,940 INFO L225 Difference]: With dead ends: 895 [2024-11-09 01:33:04,940 INFO L226 Difference]: Without dead ends: 485 [2024-11-09 01:33:04,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 39 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-09 01:33:04,941 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:33:04,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 640 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:33:04,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2024-11-09 01:33:04,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 473. [2024-11-09 01:33:04,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 408 states have (on average 1.2916666666666667) internal successors, (527), 413 states have internal predecessors, (527), 54 states have call successors, (54), 10 states have call predecessors, (54), 10 states have return successors, (54), 49 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-09 01:33:04,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 635 transitions. [2024-11-09 01:33:04,982 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 635 transitions. Word has length 147 [2024-11-09 01:33:04,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:33:04,983 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 635 transitions. [2024-11-09 01:33:04,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:04,983 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 635 transitions. [2024-11-09 01:33:04,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-09 01:33:04,984 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:33:04,984 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:33:04,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 01:33:04,984 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:33:04,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:33:04,985 INFO L85 PathProgramCache]: Analyzing trace with hash -2144036769, now seen corresponding path program 1 times [2024-11-09 01:33:04,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:33:04,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301158799] [2024-11-09 01:33:04,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:04,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:33:05,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:33:05,130 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 01:33:05,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:33:05,247 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 01:33:05,247 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 01:33:05,248 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 01:33:05,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 01:33:05,252 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:33:05,340 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 01:33:05,342 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 01:33:05 BoogieIcfgContainer [2024-11-09 01:33:05,342 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 01:33:05,343 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 01:33:05,343 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 01:33:05,343 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 01:33:05,343 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:32:56" (3/4) ... [2024-11-09 01:33:05,345 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 01:33:05,346 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 01:33:05,346 INFO L158 Benchmark]: Toolchain (without parser) took 10298.99ms. Allocated memory was 176.2MB in the beginning and 413.1MB in the end (delta: 237.0MB). Free memory was 146.4MB in the beginning and 262.8MB in the end (delta: -116.5MB). Peak memory consumption was 121.5MB. Max. memory is 16.1GB. [2024-11-09 01:33:05,346 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 130.0MB. Free memory was 92.0MB in the beginning and 91.9MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:33:05,347 INFO L158 Benchmark]: CACSL2BoogieTranslator took 474.39ms. Allocated memory is still 176.2MB. Free memory was 145.6MB in the beginning and 128.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 01:33:05,347 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.18ms. Allocated memory is still 176.2MB. Free memory was 128.9MB in the beginning and 125.4MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 01:33:05,347 INFO L158 Benchmark]: Boogie Preprocessor took 96.05ms. Allocated memory is still 176.2MB. Free memory was 125.4MB in the beginning and 120.5MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 01:33:05,347 INFO L158 Benchmark]: RCFGBuilder took 599.43ms. Allocated memory is still 176.2MB. Free memory was 120.5MB in the beginning and 89.0MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-09 01:33:05,348 INFO L158 Benchmark]: TraceAbstraction took 9053.24ms. Allocated memory was 176.2MB in the beginning and 413.1MB in the end (delta: 237.0MB). Free memory was 88.3MB in the beginning and 263.9MB in the end (delta: -175.6MB). Peak memory consumption was 60.7MB. Max. memory is 16.1GB. [2024-11-09 01:33:05,348 INFO L158 Benchmark]: Witness Printer took 2.91ms. Allocated memory is still 413.1MB. Free memory was 263.9MB in the beginning and 262.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 01:33:05,349 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 130.0MB. Free memory was 92.0MB in the beginning and 91.9MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 474.39ms. Allocated memory is still 176.2MB. Free memory was 145.6MB in the beginning and 128.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.18ms. Allocated memory is still 176.2MB. Free memory was 128.9MB in the beginning and 125.4MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 96.05ms. Allocated memory is still 176.2MB. Free memory was 125.4MB in the beginning and 120.5MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 599.43ms. Allocated memory is still 176.2MB. Free memory was 120.5MB in the beginning and 89.0MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 9053.24ms. Allocated memory was 176.2MB in the beginning and 413.1MB in the end (delta: 237.0MB). Free memory was 88.3MB in the beginning and 263.9MB in the end (delta: -175.6MB). Peak memory consumption was 60.7MB. Max. memory is 16.1GB. * Witness Printer took 2.91ms. Allocated memory is still 413.1MB. Free memory was 263.9MB in the beginning and 262.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 100. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 1, 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 1, 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 1, 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 1, 0, 0 }; [L25-L27] float float_Array_0[1] = { 63.5 }; [L25-L27] float float_Array_0[1] = { 63.5 }; [L28-L30] signed char signed_char_Array_0[2][2][2] = { {{32, -4}, {32, -64}}, {{64, 16}, {4, 50}} }; [L28-L30] signed char signed_char_Array_0[2][2][2] = { {{32, -4}, {32, -64}}, {{64, 16}, {4, 50}} }; [L28-L30] signed char signed_char_Array_0[2][2][2] = { {{32, -4}, {32, -64}}, {{64, 16}, {4, 50}} }; [L28-L30] signed char signed_char_Array_0[2][2][2] = { {{32, -4}, {32, -64}}, {{64, 16}, {4, 50}} }; [L28-L30] signed char signed_char_Array_0[2][2][2] = { {{32, -4}, {32, -64}}, {{64, 16}, {4, 50}} }; [L28-L30] signed char signed_char_Array_0[2][2][2] = { {{32, -4}, {32, -64}}, {{64, 16}, {4, 50}} }; [L28-L30] signed char signed_char_Array_0[2][2][2] = { {{32, -4}, {32, -64}}, {{64, 16}, {4, 50}} }; [L28-L30] signed char signed_char_Array_0[2][2][2] = { {{32, -4}, {32, -64}}, {{64, 16}, {4, 50}} }; [L28-L30] signed char signed_char_Array_0[2][2][2] = { {{32, -4}, {32, -64}}, {{64, 16}, {4, 50}} }; [L31-L33] signed long int signed_long_int_Array_0[1] = { 1 }; [L31-L33] signed long int signed_long_int_Array_0[1] = { 1 }; [L34] signed char last_1_signed_char_Array_0_1__0__0_ = 64; [L35] signed char last_1_signed_char_Array_0_0__1__1_ = -64; VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=0, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L104] isInitial = 1 [L105] FCALL initially() [L106] COND TRUE 1 [L107] CALL updateLastVariables() [L96] EXPR signed_char_Array_0[1][0][0] [L96] last_1_signed_char_Array_0_1__0__0_ = signed_char_Array_0[1][0][0] [L97] EXPR signed_char_Array_0[0][1][1] [L97] last_1_signed_char_Array_0_0__1__1_ = signed_char_Array_0[0][1][1] [L107] RET updateLastVariables() [L108] CALL updateVariables() [L67] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L68] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L68] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L68] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L69] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L69] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L69] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L70] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L71] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L71] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L71] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L72] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L72] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L72] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L73] BOOL_unsigned_char_Array_0[2] = __VERIFIER_nondet_uchar() [L74] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L74] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L74] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L75] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L75] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[2] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L75] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[2] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L76] signed_char_Array_0[0][0][0] = __VERIFIER_nondet_char() [L77] EXPR signed_char_Array_0[0][0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L77] CALL assume_abort_if_not(signed_char_Array_0[0][0][0] >= -1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L77] RET assume_abort_if_not(signed_char_Array_0[0][0][0] >= -1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L78] EXPR signed_char_Array_0[0][0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L78] CALL assume_abort_if_not(signed_char_Array_0[0][0][0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L78] RET assume_abort_if_not(signed_char_Array_0[0][0][0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L79] signed_char_Array_0[0][1][0] = __VERIFIER_nondet_char() [L80] EXPR signed_char_Array_0[0][1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L80] CALL assume_abort_if_not(signed_char_Array_0[0][1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L80] RET assume_abort_if_not(signed_char_Array_0[0][1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L81] EXPR signed_char_Array_0[0][1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L81] CALL assume_abort_if_not(signed_char_Array_0[0][1][0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L81] RET assume_abort_if_not(signed_char_Array_0[0][1][0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L82] signed_char_Array_0[1][1][0] = __VERIFIER_nondet_char() [L83] EXPR signed_char_Array_0[1][1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L83] CALL assume_abort_if_not(signed_char_Array_0[1][1][0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L83] RET assume_abort_if_not(signed_char_Array_0[1][1][0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L84] EXPR signed_char_Array_0[1][1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L84] CALL assume_abort_if_not(signed_char_Array_0[1][1][0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L84] RET assume_abort_if_not(signed_char_Array_0[1][1][0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L85] signed_char_Array_0[0][0][1] = __VERIFIER_nondet_char() [L86] EXPR signed_char_Array_0[0][0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L86] CALL assume_abort_if_not(signed_char_Array_0[0][0][1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L86] RET assume_abort_if_not(signed_char_Array_0[0][0][1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L87] EXPR signed_char_Array_0[0][0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L87] CALL assume_abort_if_not(signed_char_Array_0[0][0][1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L87] RET assume_abort_if_not(signed_char_Array_0[0][0][1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L88] signed_char_Array_0[1][0][1] = __VERIFIER_nondet_char() [L89] EXPR signed_char_Array_0[1][0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L89] CALL assume_abort_if_not(signed_char_Array_0[1][0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L89] RET assume_abort_if_not(signed_char_Array_0[1][0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L90] EXPR signed_char_Array_0[1][0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L90] CALL assume_abort_if_not(signed_char_Array_0[1][0][1] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L90] RET assume_abort_if_not(signed_char_Array_0[1][0][1] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L91] signed_char_Array_0[1][1][1] = __VERIFIER_nondet_char() [L92] EXPR signed_char_Array_0[1][1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L92] CALL assume_abort_if_not(signed_char_Array_0[1][1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L92] RET assume_abort_if_not(signed_char_Array_0[1][1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L93] EXPR signed_char_Array_0[1][1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L93] CALL assume_abort_if_not(signed_char_Array_0[1][1][1] <= 64) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L93] RET assume_abort_if_not(signed_char_Array_0[1][1][1] <= 64) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L108] RET updateVariables() [L109] CALL step() [L39] EXPR BOOL_unsigned_char_Array_0[0] [L39] unsigned char stepLocal_0 = BOOL_unsigned_char_Array_0[0]; [L40] COND TRUE ! (last_1_signed_char_Array_0_0__1__1_ >= last_1_signed_char_Array_0_1__0__0_) [L41] EXPR BOOL_unsigned_char_Array_0[2] [L41] EXPR BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, stepLocal_0=-511] [L41] EXPR BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L41] COND TRUE (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]) && stepLocal_0 [L42] signed_long_int_Array_0[0] = ((((last_1_signed_char_Array_0_1__0__0_) < (last_1_signed_char_Array_0_0__1__1_)) ? (last_1_signed_char_Array_0_1__0__0_) : (last_1_signed_char_Array_0_0__1__1_))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L49] EXPR signed_char_Array_0[1][1][1] [L49] EXPR signed_char_Array_0[1][0][1] [L49] EXPR signed_char_Array_0[0][1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L49] EXPR ((64) > (signed_char_Array_0[0][1][0])) ? (64) : (signed_char_Array_0[0][1][0]) [L49] EXPR ((64) > (signed_char_Array_0[0][1][0])) ? (64) : (signed_char_Array_0[0][1][0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L49] signed long int stepLocal_3 = (signed_char_Array_0[1][1][1] + signed_char_Array_0[1][0][1]) - ((((64) > (signed_char_Array_0[0][1][0])) ? (64) : (signed_char_Array_0[0][1][0]))); [L50] EXPR signed_char_Array_0[0][0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L50] COND TRUE signed_char_Array_0[0][0][0] < stepLocal_3 [L51] EXPR signed_char_Array_0[1][0][1] [L51] EXPR signed_char_Array_0[0][1][0] [L51] signed_char_Array_0[0][1][1] = ((64 - signed_char_Array_0[1][0][1]) - signed_char_Array_0[0][1][0]) [L55] float_Array_0[0] = 128.91f [L56] EXPR signed_char_Array_0[0][1][1] [L56] EXPR signed_long_int_Array_0[0] [L56] unsigned char stepLocal_2 = signed_char_Array_0[0][1][1] == signed_long_int_Array_0[0]; [L57] EXPR BOOL_unsigned_char_Array_0[1] [L57] unsigned char stepLocal_1 = BOOL_unsigned_char_Array_0[1]; [L58] stepLocal_1 && BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, stepLocal_2=0] [L58] stepLocal_1 && BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L58] COND FALSE !(stepLocal_1 && BOOL_unsigned_char_Array_0[2]) [L63] EXPR signed_char_Array_0[0][0][0] [L63] EXPR signed_char_Array_0[0][1][0] [L63] signed_char_Array_0[1][0][0] = (signed_char_Array_0[0][0][0] - signed_char_Array_0[0][1][0]) [L109] RET step() [L110] CALL, EXPR property() [L100] EXPR (! (last_1_signed_char_Array_0_0__1__1_ >= last_1_signed_char_Array_0_1__0__0_)) ? (((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((last_1_signed_char_Array_0_1__0__0_) < (last_1_signed_char_Array_0_0__1__1_)) ? (last_1_signed_char_Array_0_1__0__0_) : (last_1_signed_char_Array_0_0__1__1_))))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_)) [L100] EXPR BOOL_unsigned_char_Array_0[2] [L100] EXPR BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L100] EXPR BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L100] EXPR (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L100] EXPR (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0] [L100] EXPR BOOL_unsigned_char_Array_0[0] [L100] EXPR (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L100] EXPR ((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((last_1_signed_char_Array_0_1__0__0_) < (last_1_signed_char_Array_0_0__1__1_)) ? (last_1_signed_char_Array_0_1__0__0_) : (last_1_signed_char_Array_0_0__1__1_))))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_)) [L100] EXPR signed_long_int_Array_0[0] [L100] EXPR ((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((last_1_signed_char_Array_0_1__0__0_) < (last_1_signed_char_Array_0_0__1__1_)) ? (last_1_signed_char_Array_0_1__0__0_) : (last_1_signed_char_Array_0_0__1__1_))))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_)) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L100] EXPR (! (last_1_signed_char_Array_0_0__1__1_ >= last_1_signed_char_Array_0_1__0__0_)) ? (((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((last_1_signed_char_Array_0_1__0__0_) < (last_1_signed_char_Array_0_0__1__1_)) ? (last_1_signed_char_Array_0_1__0__0_) : (last_1_signed_char_Array_0_0__1__1_))))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_)) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L100] EXPR ((! (last_1_signed_char_Array_0_0__1__1_ >= last_1_signed_char_Array_0_1__0__0_)) ? (((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((last_1_signed_char_Array_0_1__0__0_) < (last_1_signed_char_Array_0_0__1__1_)) ? (last_1_signed_char_Array_0_1__0__0_) : (last_1_signed_char_Array_0_0__1__1_))))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) && ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[2]) ? ((BOOL_unsigned_char_Array_0[0] || (signed_char_Array_0[0][1][1] == signed_long_int_Array_0[0])) ? (signed_char_Array_0[1][0][0] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1]))))) : 1) : (signed_char_Array_0[1][0][0] == ((signed char) (signed_char_Array_0[0][0][0] - signed_char_Array_0[0][1][0])))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L100] EXPR ((! (last_1_signed_char_Array_0_0__1__1_ >= last_1_signed_char_Array_0_1__0__0_)) ? (((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((last_1_signed_char_Array_0_1__0__0_) < (last_1_signed_char_Array_0_0__1__1_)) ? (last_1_signed_char_Array_0_1__0__0_) : (last_1_signed_char_Array_0_0__1__1_))))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) && ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[2]) ? ((BOOL_unsigned_char_Array_0[0] || (signed_char_Array_0[0][1][1] == signed_long_int_Array_0[0])) ? (signed_char_Array_0[1][0][0] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1]))))) : 1) : (signed_char_Array_0[1][0][0] == ((signed char) (signed_char_Array_0[0][0][0] - signed_char_Array_0[0][1][0])))) [L100] EXPR BOOL_unsigned_char_Array_0[1] [L100] EXPR BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L100] EXPR BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L100] EXPR (BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[2]) ? ((BOOL_unsigned_char_Array_0[0] || (signed_char_Array_0[0][1][1] == signed_long_int_Array_0[0])) ? (signed_char_Array_0[1][0][0] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1]))))) : 1) : (signed_char_Array_0[1][0][0] == ((signed char) (signed_char_Array_0[0][0][0] - signed_char_Array_0[0][1][0]))) [L100] EXPR signed_char_Array_0[1][0][0] [L100] EXPR signed_char_Array_0[0][0][0] [L100] EXPR signed_char_Array_0[0][1][0] [L100] EXPR (BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[2]) ? ((BOOL_unsigned_char_Array_0[0] || (signed_char_Array_0[0][1][1] == signed_long_int_Array_0[0])) ? (signed_char_Array_0[1][0][0] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1]))))) : 1) : (signed_char_Array_0[1][0][0] == ((signed char) (signed_char_Array_0[0][0][0] - signed_char_Array_0[0][1][0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L100] EXPR ((! (last_1_signed_char_Array_0_0__1__1_ >= last_1_signed_char_Array_0_1__0__0_)) ? (((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((last_1_signed_char_Array_0_1__0__0_) < (last_1_signed_char_Array_0_0__1__1_)) ? (last_1_signed_char_Array_0_1__0__0_) : (last_1_signed_char_Array_0_0__1__1_))))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) && ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[2]) ? ((BOOL_unsigned_char_Array_0[0] || (signed_char_Array_0[0][1][1] == signed_long_int_Array_0[0])) ? (signed_char_Array_0[1][0][0] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1]))))) : 1) : (signed_char_Array_0[1][0][0] == ((signed char) (signed_char_Array_0[0][0][0] - signed_char_Array_0[0][1][0])))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L100] EXPR (((! (last_1_signed_char_Array_0_0__1__1_ >= last_1_signed_char_Array_0_1__0__0_)) ? (((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((last_1_signed_char_Array_0_1__0__0_) < (last_1_signed_char_Array_0_0__1__1_)) ? (last_1_signed_char_Array_0_1__0__0_) : (last_1_signed_char_Array_0_0__1__1_))))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) && ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[2]) ? ((BOOL_unsigned_char_Array_0[0] || (signed_char_Array_0[0][1][1] == signed_long_int_Array_0[0])) ? (signed_char_Array_0[1][0][0] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1]))))) : 1) : (signed_char_Array_0[1][0][0] == ((signed char) (signed_char_Array_0[0][0][0] - signed_char_Array_0[0][1][0]))))) && ((signed_char_Array_0[0][0][0] < ((signed_char_Array_0[1][1][1] + signed_char_Array_0[1][0][1]) - ((((64) > (signed_char_Array_0[0][1][0])) ? (64) : (signed_char_Array_0[0][1][0]))))) ? (signed_char_Array_0[0][1][1] == ((signed char) ((64 - signed_char_Array_0[1][0][1]) - signed_char_Array_0[0][1][0]))) : (signed_char_Array_0[0][1][1] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L100] EXPR (((! (last_1_signed_char_Array_0_0__1__1_ >= last_1_signed_char_Array_0_1__0__0_)) ? (((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((last_1_signed_char_Array_0_1__0__0_) < (last_1_signed_char_Array_0_0__1__1_)) ? (last_1_signed_char_Array_0_1__0__0_) : (last_1_signed_char_Array_0_0__1__1_))))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) && ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[2]) ? ((BOOL_unsigned_char_Array_0[0] || (signed_char_Array_0[0][1][1] == signed_long_int_Array_0[0])) ? (signed_char_Array_0[1][0][0] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1]))))) : 1) : (signed_char_Array_0[1][0][0] == ((signed char) (signed_char_Array_0[0][0][0] - signed_char_Array_0[0][1][0]))))) && ((signed_char_Array_0[0][0][0] < ((signed_char_Array_0[1][1][1] + signed_char_Array_0[1][0][1]) - ((((64) > (signed_char_Array_0[0][1][0])) ? (64) : (signed_char_Array_0[0][1][0]))))) ? (signed_char_Array_0[0][1][1] == ((signed char) ((64 - signed_char_Array_0[1][0][1]) - signed_char_Array_0[0][1][0]))) : (signed_char_Array_0[0][1][1] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1])))))) [L100] EXPR signed_char_Array_0[0][0][0] [L100] EXPR signed_char_Array_0[1][1][1] [L100] EXPR signed_char_Array_0[1][0][1] [L100] EXPR signed_char_Array_0[0][1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L100] EXPR ((64) > (signed_char_Array_0[0][1][0])) ? (64) : (signed_char_Array_0[0][1][0]) [L100] EXPR ((64) > (signed_char_Array_0[0][1][0])) ? (64) : (signed_char_Array_0[0][1][0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L100] EXPR (signed_char_Array_0[0][0][0] < ((signed_char_Array_0[1][1][1] + signed_char_Array_0[1][0][1]) - ((((64) > (signed_char_Array_0[0][1][0])) ? (64) : (signed_char_Array_0[0][1][0]))))) ? (signed_char_Array_0[0][1][1] == ((signed char) ((64 - signed_char_Array_0[1][0][1]) - signed_char_Array_0[0][1][0]))) : (signed_char_Array_0[0][1][1] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1]))))) [L100] EXPR signed_char_Array_0[0][1][1] [L100] EXPR signed_char_Array_0[1][0][1] [L100] EXPR signed_char_Array_0[0][1][0] [L100] EXPR (signed_char_Array_0[0][0][0] < ((signed_char_Array_0[1][1][1] + signed_char_Array_0[1][0][1]) - ((((64) > (signed_char_Array_0[0][1][0])) ? (64) : (signed_char_Array_0[0][1][0]))))) ? (signed_char_Array_0[0][1][1] == ((signed char) ((64 - signed_char_Array_0[1][0][1]) - signed_char_Array_0[0][1][0]))) : (signed_char_Array_0[0][1][1] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L100] EXPR (((! (last_1_signed_char_Array_0_0__1__1_ >= last_1_signed_char_Array_0_1__0__0_)) ? (((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((last_1_signed_char_Array_0_1__0__0_) < (last_1_signed_char_Array_0_0__1__1_)) ? (last_1_signed_char_Array_0_1__0__0_) : (last_1_signed_char_Array_0_0__1__1_))))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) && ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[2]) ? ((BOOL_unsigned_char_Array_0[0] || (signed_char_Array_0[0][1][1] == signed_long_int_Array_0[0])) ? (signed_char_Array_0[1][0][0] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1]))))) : 1) : (signed_char_Array_0[1][0][0] == ((signed char) (signed_char_Array_0[0][0][0] - signed_char_Array_0[0][1][0]))))) && ((signed_char_Array_0[0][0][0] < ((signed_char_Array_0[1][1][1] + signed_char_Array_0[1][0][1]) - ((((64) > (signed_char_Array_0[0][1][0])) ? (64) : (signed_char_Array_0[0][1][0]))))) ? (signed_char_Array_0[0][1][1] == ((signed char) ((64 - signed_char_Array_0[1][0][1]) - signed_char_Array_0[0][1][0]))) : (signed_char_Array_0[0][1][1] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L100] EXPR ((((! (last_1_signed_char_Array_0_0__1__1_ >= last_1_signed_char_Array_0_1__0__0_)) ? (((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((last_1_signed_char_Array_0_1__0__0_) < (last_1_signed_char_Array_0_0__1__1_)) ? (last_1_signed_char_Array_0_1__0__0_) : (last_1_signed_char_Array_0_0__1__1_))))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) && ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[2]) ? ((BOOL_unsigned_char_Array_0[0] || (signed_char_Array_0[0][1][1] == signed_long_int_Array_0[0])) ? (signed_char_Array_0[1][0][0] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1]))))) : 1) : (signed_char_Array_0[1][0][0] == ((signed char) (signed_char_Array_0[0][0][0] - signed_char_Array_0[0][1][0]))))) && ((signed_char_Array_0[0][0][0] < ((signed_char_Array_0[1][1][1] + signed_char_Array_0[1][0][1]) - ((((64) > (signed_char_Array_0[0][1][0])) ? (64) : (signed_char_Array_0[0][1][0]))))) ? (signed_char_Array_0[0][1][1] == ((signed char) ((64 - signed_char_Array_0[1][0][1]) - signed_char_Array_0[0][1][0]))) : (signed_char_Array_0[0][1][1] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1]))))))) && (float_Array_0[0] == ((float) 128.91f)) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L100] EXPR ((((! (last_1_signed_char_Array_0_0__1__1_ >= last_1_signed_char_Array_0_1__0__0_)) ? (((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((last_1_signed_char_Array_0_1__0__0_) < (last_1_signed_char_Array_0_0__1__1_)) ? (last_1_signed_char_Array_0_1__0__0_) : (last_1_signed_char_Array_0_0__1__1_))))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) && ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[2]) ? ((BOOL_unsigned_char_Array_0[0] || (signed_char_Array_0[0][1][1] == signed_long_int_Array_0[0])) ? (signed_char_Array_0[1][0][0] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1]))))) : 1) : (signed_char_Array_0[1][0][0] == ((signed char) (signed_char_Array_0[0][0][0] - signed_char_Array_0[0][1][0]))))) && ((signed_char_Array_0[0][0][0] < ((signed_char_Array_0[1][1][1] + signed_char_Array_0[1][0][1]) - ((((64) > (signed_char_Array_0[0][1][0])) ? (64) : (signed_char_Array_0[0][1][0]))))) ? (signed_char_Array_0[0][1][1] == ((signed char) ((64 - signed_char_Array_0[1][0][1]) - signed_char_Array_0[0][1][0]))) : (signed_char_Array_0[0][1][1] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1]))))))) && (float_Array_0[0] == ((float) 128.91f)) [L100] EXPR float_Array_0[0] [L100] EXPR ((((! (last_1_signed_char_Array_0_0__1__1_ >= last_1_signed_char_Array_0_1__0__0_)) ? (((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((last_1_signed_char_Array_0_1__0__0_) < (last_1_signed_char_Array_0_0__1__1_)) ? (last_1_signed_char_Array_0_1__0__0_) : (last_1_signed_char_Array_0_0__1__1_))))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) && ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[2]) ? ((BOOL_unsigned_char_Array_0[0] || (signed_char_Array_0[0][1][1] == signed_long_int_Array_0[0])) ? (signed_char_Array_0[1][0][0] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1]))))) : 1) : (signed_char_Array_0[1][0][0] == ((signed char) (signed_char_Array_0[0][0][0] - signed_char_Array_0[0][1][0]))))) && ((signed_char_Array_0[0][0][0] < ((signed_char_Array_0[1][1][1] + signed_char_Array_0[1][0][1]) - ((((64) > (signed_char_Array_0[0][1][0])) ? (64) : (signed_char_Array_0[0][1][0]))))) ? (signed_char_Array_0[0][1][1] == ((signed char) ((64 - signed_char_Array_0[1][0][1]) - signed_char_Array_0[0][1][0]))) : (signed_char_Array_0[0][1][1] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1]))))))) && (float_Array_0[0] == ((float) 128.91f)) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L100-L101] return ((((! (last_1_signed_char_Array_0_0__1__1_ >= last_1_signed_char_Array_0_1__0__0_)) ? (((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((last_1_signed_char_Array_0_1__0__0_) < (last_1_signed_char_Array_0_0__1__1_)) ? (last_1_signed_char_Array_0_1__0__0_) : (last_1_signed_char_Array_0_0__1__1_))))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) && ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[2]) ? ((BOOL_unsigned_char_Array_0[0] || (signed_char_Array_0[0][1][1] == signed_long_int_Array_0[0])) ? (signed_char_Array_0[1][0][0] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1]))))) : 1) : (signed_char_Array_0[1][0][0] == ((signed char) (signed_char_Array_0[0][0][0] - signed_char_Array_0[0][1][0]))))) && ((signed_char_Array_0[0][0][0] < ((signed_char_Array_0[1][1][1] + signed_char_Array_0[1][0][1]) - ((((64) > (signed_char_Array_0[0][1][0])) ? (64) : (signed_char_Array_0[0][1][0]))))) ? (signed_char_Array_0[0][1][1] == ((signed char) ((64 - signed_char_Array_0[1][0][1]) - signed_char_Array_0[0][1][0]))) : (signed_char_Array_0[0][1][1] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1]))))))) && (float_Array_0[0] == ((float) 128.91f)) ; [L110] RET, EXPR property() [L110] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 97 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.9s, OverallIterations: 18, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1104 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1101 mSDsluCounter, 8775 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6274 mSDsCounter, 113 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1217 IncrementalHoareTripleChecker+Invalid, 1330 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 113 mSolverCounterUnsat, 2501 mSDtfsCounter, 1217 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 754 GetRequests, 677 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=473occurred in iteration=17, InterpolantAutomatonStates: 94, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 561 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 2555 NumberOfCodeBlocks, 2555 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 2391 ConstructedInterpolants, 0 QuantifiedInterpolants, 4629 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 10404/10404 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 01:33:05,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-57.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 523cdc555ae18a7121d858cb3ce401c3fbc4c545022234654bee429dbd299e9d --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:33:07,682 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:33:07,751 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 01:33:07,757 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:33:07,758 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:33:07,784 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:33:07,784 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:33:07,785 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:33:07,785 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:33:07,786 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:33:07,786 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:33:07,787 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:33:07,788 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:33:07,788 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:33:07,788 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:33:07,791 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:33:07,791 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:33:07,792 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:33:07,792 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:33:07,792 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:33:07,792 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:33:07,793 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:33:07,793 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:33:07,793 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 01:33:07,794 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 01:33:07,794 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:33:07,794 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 01:33:07,794 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:33:07,794 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:33:07,795 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:33:07,795 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:33:07,795 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:33:07,795 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:33:07,795 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:33:07,796 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:33:07,796 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:33:07,796 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:33:07,796 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:33:07,796 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 01:33:07,797 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 01:33:07,797 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:33:07,797 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:33:07,797 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:33:07,798 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:33:07,798 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 -> 523cdc555ae18a7121d858cb3ce401c3fbc4c545022234654bee429dbd299e9d [2024-11-09 01:33:08,061 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:33:08,079 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:33:08,082 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:33:08,082 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:33:08,083 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:33:08,084 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-57.i [2024-11-09 01:33:09,403 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:33:09,641 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:33:09,642 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-57.i [2024-11-09 01:33:09,658 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22cd8dde6/935fee04c96249dfb907964a42282cce/FLAG50bc23e0d [2024-11-09 01:33:09,987 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22cd8dde6/935fee04c96249dfb907964a42282cce [2024-11-09 01:33:09,989 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:33:09,990 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:33:09,991 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:33:09,991 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:33:09,995 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:33:09,996 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:33:09" (1/1) ... [2024-11-09 01:33:09,996 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@778c2ab4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:33:09, skipping insertion in model container [2024-11-09 01:33:09,996 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:33:09" (1/1) ... [2024-11-09 01:33:10,020 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:33:10,196 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-57.i[916,929] [2024-11-09 01:33:10,320 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:33:10,340 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:33:10,351 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-57.i[916,929] [2024-11-09 01:33:10,405 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:33:10,422 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:33:10,423 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:33:10 WrapperNode [2024-11-09 01:33:10,423 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:33:10,424 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:33:10,424 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:33:10,424 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:33:10,429 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:33:10" (1/1) ... [2024-11-09 01:33:10,448 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:33:10" (1/1) ... [2024-11-09 01:33:10,487 INFO L138 Inliner]: procedures = 33, calls = 143, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 412 [2024-11-09 01:33:10,489 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:33:10,490 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:33:10,491 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:33:10,491 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:33:10,499 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:33:10" (1/1) ... [2024-11-09 01:33:10,500 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:33:10" (1/1) ... [2024-11-09 01:33:10,508 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:33:10" (1/1) ... [2024-11-09 01:33:10,533 INFO L175 MemorySlicer]: Split 110 memory accesses to 5 slices as follows [2, 24, 3, 72, 9]. 65 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 3, 1, 8, 1]. The 17 writes are split as follows [0, 3, 1, 10, 3]. [2024-11-09 01:33:10,537 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:33:10" (1/1) ... [2024-11-09 01:33:10,537 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:33:10" (1/1) ... [2024-11-09 01:33:10,560 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:33:10" (1/1) ... [2024-11-09 01:33:10,568 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:33:10" (1/1) ... [2024-11-09 01:33:10,572 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:33:10" (1/1) ... [2024-11-09 01:33:10,575 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:33:10" (1/1) ... [2024-11-09 01:33:10,579 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:33:10,580 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:33:10,580 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:33:10,580 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:33:10,581 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:33:10" (1/1) ... [2024-11-09 01:33:10,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:33:10,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:33:10,615 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 01:33:10,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 01:33:10,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:33:10,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-09 01:33:10,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-09 01:33:10,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-09 01:33:10,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-09 01:33:10,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-09 01:33:10,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 01:33:10,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 01:33:10,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-09 01:33:10,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-09 01:33:10,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-09 01:33:10,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-09 01:33:10,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-09 01:33:10,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-09 01:33:10,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-09 01:33:10,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-09 01:33:10,716 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-09 01:33:10,716 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-09 01:33:10,716 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-09 01:33:10,716 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-09 01:33:10,717 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-09 01:33:10,717 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-09 01:33:10,717 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-09 01:33:10,717 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-09 01:33:10,717 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-09 01:33:10,717 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-09 01:33:10,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-09 01:33:10,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-09 01:33:10,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-09 01:33:10,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-09 01:33:10,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-09 01:33:10,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-09 01:33:10,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-09 01:33:10,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-09 01:33:10,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-09 01:33:10,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-09 01:33:10,718 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:33:10,718 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:33:10,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:33:10,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:33:10,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-09 01:33:10,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-09 01:33:10,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-09 01:33:10,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-09 01:33:10,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-09 01:33:10,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-09 01:33:10,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-09 01:33:10,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-09 01:33:10,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-09 01:33:10,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-09 01:33:10,848 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:33:10,850 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:33:11,136 INFO L? ?]: Removed 94 outVars from TransFormulas that were not future-live. [2024-11-09 01:33:11,136 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:33:11,146 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:33:11,146 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:33:11,147 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:33:11 BoogieIcfgContainer [2024-11-09 01:33:11,147 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:33:11,148 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:33:11,148 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:33:11,150 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:33:11,151 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:33:09" (1/3) ... [2024-11-09 01:33:11,151 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c847eef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:33:11, skipping insertion in model container [2024-11-09 01:33:11,151 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:33:10" (2/3) ... [2024-11-09 01:33:11,152 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c847eef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:33:11, skipping insertion in model container [2024-11-09 01:33:11,152 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:33:11" (3/3) ... [2024-11-09 01:33:11,153 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-57.i [2024-11-09 01:33:11,165 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:33:11,165 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:33:11,207 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:33:11,212 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;@5f9740a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:33:11,212 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:33:11,215 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 76 states have (on average 1.394736842105263) internal successors, (106), 77 states have internal predecessors, (106), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 01:33:11,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-09 01:33:11,224 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:33:11,225 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:33:11,225 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:33:11,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:33:11,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1840313941, now seen corresponding path program 1 times [2024-11-09 01:33:11,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:33:11,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [746497514] [2024-11-09 01:33:11,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:11,239 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:33:11,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:33:11,242 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:33:11,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 01:33:11,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:11,451 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 01:33:11,459 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:33:11,500 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 322 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2024-11-09 01:33:11,500 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:33:11,501 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:33:11,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [746497514] [2024-11-09 01:33:11,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [746497514] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:33:11,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:33:11,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:33:11,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833897757] [2024-11-09 01:33:11,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:33:11,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:33:11,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:33:11,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:33:11,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:33:11,532 INFO L87 Difference]: Start difference. First operand has 97 states, 76 states have (on average 1.394736842105263) internal successors, (106), 77 states have internal predecessors, (106), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-09 01:33:11,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:33:11,563 INFO L93 Difference]: Finished difference Result 187 states and 296 transitions. [2024-11-09 01:33:11,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:33:11,565 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 134 [2024-11-09 01:33:11,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:33:11,571 INFO L225 Difference]: With dead ends: 187 [2024-11-09 01:33:11,571 INFO L226 Difference]: Without dead ends: 93 [2024-11-09 01:33:11,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:33:11,579 INFO L432 NwaCegarLoop]: 135 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, 135 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:33:11,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:33:11,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-09 01:33:11,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-09 01:33:11,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 73 states have (on average 1.356164383561644) internal successors, (99), 73 states have internal predecessors, (99), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 01:33:11,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 135 transitions. [2024-11-09 01:33:11,624 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 135 transitions. Word has length 134 [2024-11-09 01:33:11,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:33:11,624 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 135 transitions. [2024-11-09 01:33:11,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-09 01:33:11,625 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 135 transitions. [2024-11-09 01:33:11,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-09 01:33:11,629 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:33:11,629 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:33:11,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-09 01:33:11,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:33:11,831 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:33:11,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:33:11,832 INFO L85 PathProgramCache]: Analyzing trace with hash -957014791, now seen corresponding path program 1 times [2024-11-09 01:33:11,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:33:11,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [762473063] [2024-11-09 01:33:11,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:11,835 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:33:11,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:33:11,838 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:33:11,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 01:33:11,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:11,989 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 01:33:12,007 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:33:12,076 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:33:12,077 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 41 treesize of output 17 [2024-11-09 01:33:12,519 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:33:12,519 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:33:12,519 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:33:12,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [762473063] [2024-11-09 01:33:12,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [762473063] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:33:12,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:33:12,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:33:12,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098377957] [2024-11-09 01:33:12,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:33:12,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:33:12,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:33:12,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:33:12,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:33:12,523 INFO L87 Difference]: Start difference. First operand 93 states and 135 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:12,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:33:12,756 INFO L93 Difference]: Finished difference Result 274 states and 400 transitions. [2024-11-09 01:33:12,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:33:12,756 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 134 [2024-11-09 01:33:12,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:33:12,758 INFO L225 Difference]: With dead ends: 274 [2024-11-09 01:33:12,759 INFO L226 Difference]: Without dead ends: 184 [2024-11-09 01:33:12,759 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:33:12,760 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 94 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:33:12,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 322 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:33:12,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-09 01:33:12,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 153. [2024-11-09 01:33:12,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 114 states have (on average 1.3070175438596492) internal successors, (149), 114 states have internal predecessors, (149), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-09 01:33:12,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 221 transitions. [2024-11-09 01:33:12,778 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 221 transitions. Word has length 134 [2024-11-09 01:33:12,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:33:12,779 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 221 transitions. [2024-11-09 01:33:12,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:12,779 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 221 transitions. [2024-11-09 01:33:12,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-09 01:33:12,780 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:33:12,780 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:33:12,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-09 01:33:12,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:33:12,982 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:33:12,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:33:12,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1707716275, now seen corresponding path program 1 times [2024-11-09 01:33:12,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:33:12,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1579493353] [2024-11-09 01:33:12,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:12,983 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:33:12,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:33:12,986 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:33:12,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-09 01:33:13,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:13,147 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 01:33:13,155 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:33:13,478 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 267 proven. 36 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2024-11-09 01:33:13,479 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:33:13,613 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:33:13,613 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:33:13,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1579493353] [2024-11-09 01:33:13,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1579493353] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 01:33:13,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 01:33:13,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 11 [2024-11-09 01:33:13,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450995250] [2024-11-09 01:33:13,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:33:13,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:33:13,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:33:13,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:33:13,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-09 01:33:13,616 INFO L87 Difference]: Start difference. First operand 153 states and 221 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:13,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:33:13,710 INFO L93 Difference]: Finished difference Result 321 states and 467 transitions. [2024-11-09 01:33:13,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:33:13,710 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 141 [2024-11-09 01:33:13,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:33:13,712 INFO L225 Difference]: With dead ends: 321 [2024-11-09 01:33:13,712 INFO L226 Difference]: Without dead ends: 229 [2024-11-09 01:33:13,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-09 01:33:13,714 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 146 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:33:13,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 382 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:33:13,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-11-09 01:33:13,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 226. [2024-11-09 01:33:13,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 182 states have (on average 1.3681318681318682) internal successors, (249), 183 states have internal predecessors, (249), 40 states have call successors, (40), 3 states have call predecessors, (40), 3 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-09 01:33:13,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 329 transitions. [2024-11-09 01:33:13,738 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 329 transitions. Word has length 141 [2024-11-09 01:33:13,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:33:13,738 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 329 transitions. [2024-11-09 01:33:13,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:13,739 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 329 transitions. [2024-11-09 01:33:13,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-09 01:33:13,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:33:13,743 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:33:13,751 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 (4)] Forceful destruction successful, exit code 0 [2024-11-09 01:33:13,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:33:13,944 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:33:13,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:33:13,945 INFO L85 PathProgramCache]: Analyzing trace with hash 898307279, now seen corresponding path program 1 times [2024-11-09 01:33:13,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:33:13,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1214202338] [2024-11-09 01:33:13,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:13,946 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:33:13,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:33:13,952 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:33:13,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-09 01:33:14,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:14,117 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 01:33:14,121 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:33:14,150 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:33:14,151 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 41 treesize of output 17 [2024-11-09 01:33:14,507 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 45 treesize of output 32 [2024-11-09 01:33:14,509 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-09 01:33:14,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 8 [2024-11-09 01:33:14,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 54 [2024-11-09 01:33:14,634 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:33:14,634 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:33:14,635 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:33:14,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1214202338] [2024-11-09 01:33:14,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1214202338] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:33:14,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:33:14,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 01:33:14,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395188731] [2024-11-09 01:33:14,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:33:14,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 01:33:14,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:33:14,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 01:33:14,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:33:14,636 INFO L87 Difference]: Start difference. First operand 226 states and 329 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:15,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:33:15,044 INFO L93 Difference]: Finished difference Result 433 states and 634 transitions. [2024-11-09 01:33:15,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 01:33:15,044 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 141 [2024-11-09 01:33:15,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:33:15,047 INFO L225 Difference]: With dead ends: 433 [2024-11-09 01:33:15,047 INFO L226 Difference]: Without dead ends: 286 [2024-11-09 01:33:15,048 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-09 01:33:15,049 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 85 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:33:15,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 689 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:33:15,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-11-09 01:33:15,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 240. [2024-11-09 01:33:15,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 196 states have (on average 1.3724489795918366) internal successors, (269), 197 states have internal predecessors, (269), 40 states have call successors, (40), 3 states have call predecessors, (40), 3 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-09 01:33:15,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 349 transitions. [2024-11-09 01:33:15,064 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 349 transitions. Word has length 141 [2024-11-09 01:33:15,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:33:15,065 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 349 transitions. [2024-11-09 01:33:15,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:15,065 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 349 transitions. [2024-11-09 01:33:15,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-09 01:33:15,066 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:33:15,067 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:33:15,076 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-09 01:33:15,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:33:15,271 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:33:15,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:33:15,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1860013238, now seen corresponding path program 1 times [2024-11-09 01:33:15,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:33:15,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [103000873] [2024-11-09 01:33:15,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:15,272 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:33:15,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:33:15,275 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:33:15,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-09 01:33:15,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:15,570 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 01:33:15,575 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:33:15,647 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:33:15,647 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:33:15,647 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:33:15,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [103000873] [2024-11-09 01:33:15,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [103000873] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:33:15,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:33:15,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:33:15,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023546789] [2024-11-09 01:33:15,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:33:15,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:33:15,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:33:15,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:33:15,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:33:15,649 INFO L87 Difference]: Start difference. First operand 240 states and 349 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:15,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:33:15,774 INFO L93 Difference]: Finished difference Result 509 states and 733 transitions. [2024-11-09 01:33:15,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:33:15,774 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 144 [2024-11-09 01:33:15,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:33:15,776 INFO L225 Difference]: With dead ends: 509 [2024-11-09 01:33:15,777 INFO L226 Difference]: Without dead ends: 338 [2024-11-09 01:33:15,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:33:15,778 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 41 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:33:15,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 467 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:33:15,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2024-11-09 01:33:15,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 334. [2024-11-09 01:33:15,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 283 states have (on average 1.3498233215547704) internal successors, (382), 286 states have internal predecessors, (382), 44 states have call successors, (44), 6 states have call predecessors, (44), 6 states have return successors, (44), 41 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-09 01:33:15,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 470 transitions. [2024-11-09 01:33:15,804 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 470 transitions. Word has length 144 [2024-11-09 01:33:15,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:33:15,805 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 470 transitions. [2024-11-09 01:33:15,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:15,805 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 470 transitions. [2024-11-09 01:33:15,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-09 01:33:15,806 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:33:15,806 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:33:15,816 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-09 01:33:16,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:33:16,007 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:33:16,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:33:16,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1733889480, now seen corresponding path program 1 times [2024-11-09 01:33:16,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:33:16,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1179610330] [2024-11-09 01:33:16,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:16,009 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:33:16,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:33:16,011 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:33:16,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-09 01:33:16,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:16,179 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 01:33:16,183 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:33:16,202 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:33:16,203 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:33:16,203 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:33:16,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1179610330] [2024-11-09 01:33:16,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1179610330] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:33:16,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:33:16,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:33:16,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002678515] [2024-11-09 01:33:16,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:33:16,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:33:16,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:33:16,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:33:16,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:33:16,208 INFO L87 Difference]: Start difference. First operand 334 states and 470 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:16,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:33:16,259 INFO L93 Difference]: Finished difference Result 564 states and 796 transitions. [2024-11-09 01:33:16,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:33:16,259 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 144 [2024-11-09 01:33:16,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:33:16,262 INFO L225 Difference]: With dead ends: 564 [2024-11-09 01:33:16,262 INFO L226 Difference]: Without dead ends: 346 [2024-11-09 01:33:16,263 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:33:16,264 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 1 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:33:16,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 387 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:33:16,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2024-11-09 01:33:16,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 342. [2024-11-09 01:33:16,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 291 states have (on average 1.3402061855670102) internal successors, (390), 294 states have internal predecessors, (390), 44 states have call successors, (44), 6 states have call predecessors, (44), 6 states have return successors, (44), 41 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-09 01:33:16,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 478 transitions. [2024-11-09 01:33:16,286 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 478 transitions. Word has length 144 [2024-11-09 01:33:16,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:33:16,287 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 478 transitions. [2024-11-09 01:33:16,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:16,287 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 478 transitions. [2024-11-09 01:33:16,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-09 01:33:16,289 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:33:16,289 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:33:16,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-09 01:33:16,489 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-09 01:33:16,490 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:33:16,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:33:16,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1732042438, now seen corresponding path program 1 times [2024-11-09 01:33:16,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:33:16,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [69692359] [2024-11-09 01:33:16,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:16,492 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:33:16,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:33:16,498 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-09 01:33:16,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-09 01:33:16,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:16,744 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-09 01:33:16,750 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:33:16,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 01:33:16,809 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 29 treesize of output 13 [2024-11-09 01:33:16,928 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:33:16,929 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 35 treesize of output 37 [2024-11-09 01:33:17,071 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:33:17,071 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 45 treesize of output 50 [2024-11-09 01:33:17,254 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:33:17,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 55 treesize of output 63 [2024-11-09 01:33:17,470 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:33:17,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 65 treesize of output 76 [2024-11-09 01:33:18,056 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:33:18,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 108 treesize of output 104 [2024-11-09 01:33:18,272 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:33:18,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 136 treesize of output 125 [2024-11-09 01:33:18,758 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:33:18,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 202 treesize of output 96 [2024-11-09 01:33:18,870 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 472 proven. 57 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2024-11-09 01:33:18,871 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:33:19,031 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:33:19,031 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:33:19,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [69692359] [2024-11-09 01:33:19,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [69692359] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 01:33:19,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 01:33:19,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [21] total 23 [2024-11-09 01:33:19,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948731020] [2024-11-09 01:33:19,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:33:19,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:33:19,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:33:19,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:33:19,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2024-11-09 01:33:19,034 INFO L87 Difference]: Start difference. First operand 342 states and 478 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:19,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:33:19,258 INFO L93 Difference]: Finished difference Result 645 states and 900 transitions. [2024-11-09 01:33:19,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:33:19,259 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 144 [2024-11-09 01:33:19,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:33:19,261 INFO L225 Difference]: With dead ends: 645 [2024-11-09 01:33:19,261 INFO L226 Difference]: Without dead ends: 419 [2024-11-09 01:33:19,262 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=104, Invalid=546, Unknown=0, NotChecked=0, Total=650 [2024-11-09 01:33:19,262 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 62 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:33:19,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 680 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:33:19,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2024-11-09 01:33:19,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 416. [2024-11-09 01:33:19,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 355 states have (on average 1.332394366197183) internal successors, (473), 359 states have internal predecessors, (473), 52 states have call successors, (52), 8 states have call predecessors, (52), 8 states have return successors, (52), 48 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-09 01:33:19,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 577 transitions. [2024-11-09 01:33:19,279 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 577 transitions. Word has length 144 [2024-11-09 01:33:19,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:33:19,280 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 577 transitions. [2024-11-09 01:33:19,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:19,280 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 577 transitions. [2024-11-09 01:33:19,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-09 01:33:19,281 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:33:19,281 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:33:19,290 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-09 01:33:19,485 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-09 01:33:19,486 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:33:19,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:33:19,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1641585567, now seen corresponding path program 1 times [2024-11-09 01:33:19,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:33:19,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1519524221] [2024-11-09 01:33:19,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:19,487 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:33:19,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:33:19,490 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:33:19,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-09 01:33:19,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:19,622 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 01:33:19,625 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:33:19,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-09 01:33:19,670 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:33:19,670 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:33:19,670 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:33:19,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1519524221] [2024-11-09 01:33:19,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1519524221] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:33:19,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:33:19,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:33:19,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403442606] [2024-11-09 01:33:19,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:33:19,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:33:19,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:33:19,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:33:19,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:33:19,672 INFO L87 Difference]: Start difference. First operand 416 states and 577 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:19,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:33:19,870 INFO L93 Difference]: Finished difference Result 1010 states and 1408 transitions. [2024-11-09 01:33:19,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:33:19,870 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2024-11-09 01:33:19,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:33:19,873 INFO L225 Difference]: With dead ends: 1010 [2024-11-09 01:33:19,873 INFO L226 Difference]: Without dead ends: 701 [2024-11-09 01:33:19,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:33:19,874 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 83 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:33:19,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 540 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:33:19,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2024-11-09 01:33:19,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 456. [2024-11-09 01:33:19,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 395 states have (on average 1.3443037974683545) internal successors, (531), 399 states have internal predecessors, (531), 52 states have call successors, (52), 8 states have call predecessors, (52), 8 states have return successors, (52), 48 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-09 01:33:19,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 635 transitions. [2024-11-09 01:33:19,890 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 635 transitions. Word has length 145 [2024-11-09 01:33:19,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:33:19,890 INFO L471 AbstractCegarLoop]: Abstraction has 456 states and 635 transitions. [2024-11-09 01:33:19,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:19,891 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 635 transitions. [2024-11-09 01:33:19,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-09 01:33:19,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:33:19,892 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:33:19,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-09 01:33:20,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:33:20,092 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:33:20,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:33:20,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1267178335, now seen corresponding path program 1 times [2024-11-09 01:33:20,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:33:20,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1823576507] [2024-11-09 01:33:20,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:20,093 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:33:20,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:33:20,098 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:33:20,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-09 01:33:20,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:20,257 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 01:33:20,259 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:33:20,302 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:33:20,302 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:33:20,302 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:33:20,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1823576507] [2024-11-09 01:33:20,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1823576507] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:33:20,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:33:20,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:33:20,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337707559] [2024-11-09 01:33:20,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:33:20,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:33:20,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:33:20,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:33:20,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:33:20,308 INFO L87 Difference]: Start difference. First operand 456 states and 635 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:20,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:33:20,449 INFO L93 Difference]: Finished difference Result 900 states and 1253 transitions. [2024-11-09 01:33:20,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:33:20,450 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2024-11-09 01:33:20,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:33:20,454 INFO L225 Difference]: With dead ends: 900 [2024-11-09 01:33:20,454 INFO L226 Difference]: Without dead ends: 574 [2024-11-09 01:33:20,455 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:33:20,455 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 75 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:33:20,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 836 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:33:20,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2024-11-09 01:33:20,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 492. [2024-11-09 01:33:20,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 431 states have (on average 1.3433874709976799) internal successors, (579), 435 states have internal predecessors, (579), 52 states have call successors, (52), 8 states have call predecessors, (52), 8 states have return successors, (52), 48 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-09 01:33:20,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 683 transitions. [2024-11-09 01:33:20,470 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 683 transitions. Word has length 145 [2024-11-09 01:33:20,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:33:20,470 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 683 transitions. [2024-11-09 01:33:20,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:20,471 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 683 transitions. [2024-11-09 01:33:20,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-09 01:33:20,472 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:33:20,472 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:33:20,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-09 01:33:20,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:33:20,673 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:33:20,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:33:20,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1747925283, now seen corresponding path program 1 times [2024-11-09 01:33:20,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:33:20,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [875200075] [2024-11-09 01:33:20,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:20,674 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:33:20,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:33:20,676 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:33:20,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-09 01:33:20,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:20,843 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 01:33:20,849 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:33:21,165 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 267 proven. 36 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2024-11-09 01:33:21,166 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:33:21,280 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:33:21,280 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:33:21,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [875200075] [2024-11-09 01:33:21,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [875200075] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 01:33:21,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 01:33:21,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 11 [2024-11-09 01:33:21,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792423879] [2024-11-09 01:33:21,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:33:21,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:33:21,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:33:21,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:33:21,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-09 01:33:21,282 INFO L87 Difference]: Start difference. First operand 492 states and 683 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:21,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:33:21,386 INFO L93 Difference]: Finished difference Result 825 states and 1145 transitions. [2024-11-09 01:33:21,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:33:21,387 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2024-11-09 01:33:21,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:33:21,389 INFO L225 Difference]: With dead ends: 825 [2024-11-09 01:33:21,389 INFO L226 Difference]: Without dead ends: 496 [2024-11-09 01:33:21,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-09 01:33:21,390 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 64 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:33:21,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 516 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:33:21,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2024-11-09 01:33:21,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 492. [2024-11-09 01:33:21,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 431 states have (on average 1.3410672853828307) internal successors, (578), 435 states have internal predecessors, (578), 52 states have call successors, (52), 8 states have call predecessors, (52), 8 states have return successors, (52), 48 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-09 01:33:21,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 682 transitions. [2024-11-09 01:33:21,408 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 682 transitions. Word has length 145 [2024-11-09 01:33:21,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:33:21,408 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 682 transitions. [2024-11-09 01:33:21,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:21,408 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 682 transitions. [2024-11-09 01:33:21,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-09 01:33:21,410 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:33:21,410 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:33:21,420 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-09 01:33:21,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:33:21,615 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:33:21,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:33:21,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1845977435, now seen corresponding path program 1 times [2024-11-09 01:33:21,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:33:21,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1657058135] [2024-11-09 01:33:21,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:21,616 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:33:21,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:33:21,618 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:33:21,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-09 01:33:21,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:21,791 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 01:33:21,794 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:33:21,837 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:33:21,837 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:33:21,837 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:33:21,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1657058135] [2024-11-09 01:33:21,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1657058135] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:33:21,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:33:21,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:33:21,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826850891] [2024-11-09 01:33:21,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:33:21,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:33:21,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:33:21,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:33:21,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:33:21,841 INFO L87 Difference]: Start difference. First operand 492 states and 682 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:22,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:33:22,053 INFO L93 Difference]: Finished difference Result 833 states and 1148 transitions. [2024-11-09 01:33:22,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:33:22,054 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2024-11-09 01:33:22,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:33:22,056 INFO L225 Difference]: With dead ends: 833 [2024-11-09 01:33:22,071 INFO L226 Difference]: Without dead ends: 504 [2024-11-09 01:33:22,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:33:22,072 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 53 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:33:22,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 548 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:33:22,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2024-11-09 01:33:22,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 474. [2024-11-09 01:33:22,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 413 states have (on average 1.334140435835351) internal successors, (551), 416 states have internal predecessors, (551), 50 states have call successors, (50), 10 states have call predecessors, (50), 10 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-09 01:33:22,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 651 transitions. [2024-11-09 01:33:22,090 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 651 transitions. Word has length 145 [2024-11-09 01:33:22,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:33:22,091 INFO L471 AbstractCegarLoop]: Abstraction has 474 states and 651 transitions. [2024-11-09 01:33:22,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:22,091 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 651 transitions. [2024-11-09 01:33:22,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-09 01:33:22,092 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:33:22,092 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:33:22,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-09 01:33:22,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:33:22,293 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:33:22,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:33:22,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1244546081, now seen corresponding path program 1 times [2024-11-09 01:33:22,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:33:22,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1146847315] [2024-11-09 01:33:22,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:22,295 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:33:22,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:33:22,296 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:33:22,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-09 01:33:22,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:22,433 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 01:33:22,440 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:33:22,642 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 267 proven. 36 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2024-11-09 01:33:22,642 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:33:22,720 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:33:22,721 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:33:22,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1146847315] [2024-11-09 01:33:22,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1146847315] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 01:33:22,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 01:33:22,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2024-11-09 01:33:22,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722660707] [2024-11-09 01:33:22,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:33:22,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:33:22,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:33:22,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:33:22,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:33:22,722 INFO L87 Difference]: Start difference. First operand 474 states and 651 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:22,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:33:22,823 INFO L93 Difference]: Finished difference Result 866 states and 1184 transitions. [2024-11-09 01:33:22,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:33:22,824 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2024-11-09 01:33:22,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:33:22,826 INFO L225 Difference]: With dead ends: 866 [2024-11-09 01:33:22,826 INFO L226 Difference]: Without dead ends: 541 [2024-11-09 01:33:22,827 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 280 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-09 01:33:22,827 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 137 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:33:22,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 435 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:33:22,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2024-11-09 01:33:22,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 461. [2024-11-09 01:33:22,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 399 states have (on average 1.330827067669173) internal successors, (531), 402 states have internal predecessors, (531), 50 states have call successors, (50), 11 states have call predecessors, (50), 11 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-09 01:33:22,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 631 transitions. [2024-11-09 01:33:22,842 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 631 transitions. Word has length 145 [2024-11-09 01:33:22,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:33:22,842 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 631 transitions. [2024-11-09 01:33:22,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:22,842 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 631 transitions. [2024-11-09 01:33:22,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-09 01:33:22,843 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:33:22,843 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:33:22,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-09 01:33:23,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:33:23,044 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:33:23,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:33:23,044 INFO L85 PathProgramCache]: Analyzing trace with hash -2144036769, now seen corresponding path program 1 times [2024-11-09 01:33:23,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:33:23,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1315118914] [2024-11-09 01:33:23,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:23,045 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:33:23,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:33:23,046 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:33:23,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-09 01:33:23,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:23,192 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 01:33:23,195 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:33:23,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 01:33:23,421 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 77 treesize of output 41 [2024-11-09 01:33:23,440 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:33:23,440 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:33:23,440 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:33:23,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1315118914] [2024-11-09 01:33:23,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1315118914] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:33:23,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:33:23,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:33:23,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821411743] [2024-11-09 01:33:23,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:33:23,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 01:33:23,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:33:23,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 01:33:23,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:33:23,442 INFO L87 Difference]: Start difference. First operand 461 states and 631 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:23,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:33:23,583 INFO L93 Difference]: Finished difference Result 475 states and 648 transitions. [2024-11-09 01:33:23,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:33:23,584 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2024-11-09 01:33:23,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:33:23,587 INFO L225 Difference]: With dead ends: 475 [2024-11-09 01:33:23,588 INFO L226 Difference]: Without dead ends: 473 [2024-11-09 01:33:23,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:33:23,589 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 161 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:33:23,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 850 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:33:23,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2024-11-09 01:33:23,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 473. [2024-11-09 01:33:23,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 411 states have (on average 1.3211678832116789) internal successors, (543), 414 states have internal predecessors, (543), 50 states have call successors, (50), 11 states have call predecessors, (50), 11 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-09 01:33:23,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 643 transitions. [2024-11-09 01:33:23,607 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 643 transitions. Word has length 147 [2024-11-09 01:33:23,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:33:23,607 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 643 transitions. [2024-11-09 01:33:23,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:23,608 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 643 transitions. [2024-11-09 01:33:23,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-09 01:33:23,609 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:33:23,609 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:33:23,615 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 (14)] Ended with exit code 0 [2024-11-09 01:33:23,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:33:23,814 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:33:23,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:33:23,814 INFO L85 PathProgramCache]: Analyzing trace with hash -2142189727, now seen corresponding path program 1 times [2024-11-09 01:33:23,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:33:23,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [465625293] [2024-11-09 01:33:23,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:23,814 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:33:23,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:33:23,816 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:33:23,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-09 01:33:24,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:24,087 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-09 01:33:24,091 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:33:24,097 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-09 01:33:24,136 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 25 [2024-11-09 01:33:24,225 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:33:24,226 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 36 treesize of output 38 [2024-11-09 01:33:24,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 51 [2024-11-09 01:33:24,883 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:33:24,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 78 treesize of output 74 [2024-11-09 01:33:25,433 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:33:25,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 99 treesize of output 92 [2024-11-09 01:33:25,598 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:33:25,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 122 treesize of output 121 [2024-11-09 01:33:26,244 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:33:26,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 196 treesize of output 96 [2024-11-09 01:33:26,337 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 447 proven. 33 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2024-11-09 01:33:26,337 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:33:26,525 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:33:26,525 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:33:26,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [465625293] [2024-11-09 01:33:26,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [465625293] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 01:33:26,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 01:33:26,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [25] total 27 [2024-11-09 01:33:26,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485487195] [2024-11-09 01:33:26,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:33:26,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:33:26,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:33:26,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:33:26,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=563, Unknown=0, NotChecked=0, Total=702 [2024-11-09 01:33:26,527 INFO L87 Difference]: Start difference. First operand 473 states and 643 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:26,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:33:26,801 INFO L93 Difference]: Finished difference Result 1173 states and 1588 transitions. [2024-11-09 01:33:26,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:33:26,802 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2024-11-09 01:33:26,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:33:26,806 INFO L225 Difference]: With dead ends: 1173 [2024-11-09 01:33:26,806 INFO L226 Difference]: Without dead ends: 833 [2024-11-09 01:33:26,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=151, Invalid=719, Unknown=0, NotChecked=0, Total=870 [2024-11-09 01:33:26,810 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 68 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:33:26,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 643 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:33:26,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2024-11-09 01:33:26,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 830. [2024-11-09 01:33:26,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 830 states, 738 states have (on average 1.3197831978319783) internal successors, (974), 745 states have internal predecessors, (974), 72 states have call successors, (72), 19 states have call predecessors, (72), 19 states have return successors, (72), 65 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-09 01:33:26,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1118 transitions. [2024-11-09 01:33:26,850 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1118 transitions. Word has length 147 [2024-11-09 01:33:26,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:33:26,851 INFO L471 AbstractCegarLoop]: Abstraction has 830 states and 1118 transitions. [2024-11-09 01:33:26,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:26,851 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1118 transitions. [2024-11-09 01:33:26,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-09 01:33:26,852 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:33:26,852 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:33:26,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-11-09 01:33:27,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:33:27,057 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:33:27,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:33:27,057 INFO L85 PathProgramCache]: Analyzing trace with hash 339421219, now seen corresponding path program 1 times [2024-11-09 01:33:27,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:33:27,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1485253860] [2024-11-09 01:33:27,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:27,058 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:33:27,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:33:27,060 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:33:27,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-09 01:33:27,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:27,202 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 01:33:27,205 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:33:27,399 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 267 proven. 36 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2024-11-09 01:33:27,400 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:33:27,481 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:33:27,481 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:33:27,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1485253860] [2024-11-09 01:33:27,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1485253860] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 01:33:27,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 01:33:27,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2024-11-09 01:33:27,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022258354] [2024-11-09 01:33:27,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:33:27,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:33:27,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:33:27,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:33:27,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:33:27,483 INFO L87 Difference]: Start difference. First operand 830 states and 1118 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:27,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:33:27,590 INFO L93 Difference]: Finished difference Result 1629 states and 2179 transitions. [2024-11-09 01:33:27,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:33:27,591 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2024-11-09 01:33:27,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:33:27,594 INFO L225 Difference]: With dead ends: 1629 [2024-11-09 01:33:27,594 INFO L226 Difference]: Without dead ends: 961 [2024-11-09 01:33:27,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 284 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-09 01:33:27,595 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 129 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:33:27,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 429 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:33:27,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2024-11-09 01:33:27,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 846. [2024-11-09 01:33:27,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 846 states, 754 states have (on average 1.3103448275862069) internal successors, (988), 761 states have internal predecessors, (988), 72 states have call successors, (72), 19 states have call predecessors, (72), 19 states have return successors, (72), 65 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-09 01:33:27,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1132 transitions. [2024-11-09 01:33:27,639 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1132 transitions. Word has length 147 [2024-11-09 01:33:27,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:33:27,640 INFO L471 AbstractCegarLoop]: Abstraction has 846 states and 1132 transitions. [2024-11-09 01:33:27,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:27,640 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1132 transitions. [2024-11-09 01:33:27,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-09 01:33:27,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:33:27,641 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:33:27,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2024-11-09 01:33:27,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:33:27,841 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:33:27,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:33:27,842 INFO L85 PathProgramCache]: Analyzing trace with hash 762123045, now seen corresponding path program 1 times [2024-11-09 01:33:27,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:33:27,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [796369363] [2024-11-09 01:33:27,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:27,843 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:33:27,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:33:27,844 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:33:27,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-09 01:33:28,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:28,032 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 01:33:28,035 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:33:28,246 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 267 proven. 36 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2024-11-09 01:33:28,247 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:33:28,338 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:33:28,338 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:33:28,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [796369363] [2024-11-09 01:33:28,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [796369363] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 01:33:28,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 01:33:28,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2024-11-09 01:33:28,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530873491] [2024-11-09 01:33:28,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:33:28,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:33:28,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:33:28,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:33:28,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:33:28,340 INFO L87 Difference]: Start difference. First operand 846 states and 1132 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:28,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:33:28,444 INFO L93 Difference]: Finished difference Result 1597 states and 2125 transitions. [2024-11-09 01:33:28,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:33:28,445 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2024-11-09 01:33:28,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:33:28,448 INFO L225 Difference]: With dead ends: 1597 [2024-11-09 01:33:28,448 INFO L226 Difference]: Without dead ends: 949 [2024-11-09 01:33:28,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 284 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-09 01:33:28,450 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 95 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:33:28,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 435 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:33:28,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2024-11-09 01:33:28,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 832. [2024-11-09 01:33:28,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 832 states, 740 states have (on average 1.3054054054054054) internal successors, (966), 747 states have internal predecessors, (966), 72 states have call successors, (72), 19 states have call predecessors, (72), 19 states have return successors, (72), 65 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-09 01:33:28,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 1110 transitions. [2024-11-09 01:33:28,479 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 1110 transitions. Word has length 147 [2024-11-09 01:33:28,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:33:28,480 INFO L471 AbstractCegarLoop]: Abstraction has 832 states and 1110 transitions. [2024-11-09 01:33:28,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:28,480 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1110 transitions. [2024-11-09 01:33:28,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-09 01:33:28,481 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:33:28,481 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:33:28,488 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-09 01:33:28,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:33:28,682 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:33:28,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:33:28,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1008121572, now seen corresponding path program 1 times [2024-11-09 01:33:28,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:33:28,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2138025529] [2024-11-09 01:33:28,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:28,684 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:33:28,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:33:28,686 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:33:28,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-09 01:33:28,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:28,829 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 01:33:28,832 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:33:28,900 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:33:28,900 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:33:28,901 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:33:28,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2138025529] [2024-11-09 01:33:28,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2138025529] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:33:28,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:33:28,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:33:28,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513150612] [2024-11-09 01:33:28,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:33:28,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:33:28,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:33:28,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:33:28,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:33:28,903 INFO L87 Difference]: Start difference. First operand 832 states and 1110 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:29,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:33:29,033 INFO L93 Difference]: Finished difference Result 1612 states and 2138 transitions. [2024-11-09 01:33:29,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:33:29,034 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 148 [2024-11-09 01:33:29,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:33:29,037 INFO L225 Difference]: With dead ends: 1612 [2024-11-09 01:33:29,037 INFO L226 Difference]: Without dead ends: 978 [2024-11-09 01:33:29,038 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:33:29,039 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 68 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:33:29,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 670 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:33:29,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2024-11-09 01:33:29,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 854. [2024-11-09 01:33:29,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 854 states, 762 states have (on average 1.2992125984251968) internal successors, (990), 769 states have internal predecessors, (990), 72 states have call successors, (72), 19 states have call predecessors, (72), 19 states have return successors, (72), 65 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-09 01:33:29,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 1134 transitions. [2024-11-09 01:33:29,072 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 1134 transitions. Word has length 148 [2024-11-09 01:33:29,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:33:29,073 INFO L471 AbstractCegarLoop]: Abstraction has 854 states and 1134 transitions. [2024-11-09 01:33:29,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:29,073 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1134 transitions. [2024-11-09 01:33:29,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-09 01:33:29,074 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:33:29,074 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:33:29,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2024-11-09 01:33:29,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:33:29,275 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:33:29,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:33:29,276 INFO L85 PathProgramCache]: Analyzing trace with hash -749956134, now seen corresponding path program 1 times [2024-11-09 01:33:29,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:33:29,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1951595024] [2024-11-09 01:33:29,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:29,276 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:33:29,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:33:29,279 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:33:29,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-09 01:33:29,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:29,457 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 01:33:29,460 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:33:29,479 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:33:29,479 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:33:29,480 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:33:29,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1951595024] [2024-11-09 01:33:29,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1951595024] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:33:29,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:33:29,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:33:29,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419170963] [2024-11-09 01:33:29,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:33:29,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:33:29,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:33:29,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:33:29,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:33:29,483 INFO L87 Difference]: Start difference. First operand 854 states and 1134 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:29,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:33:29,529 INFO L93 Difference]: Finished difference Result 1526 states and 2029 transitions. [2024-11-09 01:33:29,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:33:29,529 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 148 [2024-11-09 01:33:29,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:33:29,532 INFO L225 Difference]: With dead ends: 1526 [2024-11-09 01:33:29,532 INFO L226 Difference]: Without dead ends: 878 [2024-11-09 01:33:29,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 143 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-09 01:33:29,534 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:33:29,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 644 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:33:29,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2024-11-09 01:33:29,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 872. [2024-11-09 01:33:29,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 780 states have (on average 1.2923076923076924) internal successors, (1008), 787 states have internal predecessors, (1008), 72 states have call successors, (72), 19 states have call predecessors, (72), 19 states have return successors, (72), 65 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-09 01:33:29,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1152 transitions. [2024-11-09 01:33:29,559 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1152 transitions. Word has length 148 [2024-11-09 01:33:29,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:33:29,559 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1152 transitions. [2024-11-09 01:33:29,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:29,559 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1152 transitions. [2024-11-09 01:33:29,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-09 01:33:29,560 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:33:29,560 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:33:29,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-11-09 01:33:29,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:33:29,761 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:33:29,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:33:29,762 INFO L85 PathProgramCache]: Analyzing trace with hash -961998085, now seen corresponding path program 1 times [2024-11-09 01:33:29,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:33:29,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1871960827] [2024-11-09 01:33:29,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:29,762 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:33:29,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:33:29,765 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:33:29,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-09 01:33:30,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:30,032 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-09 01:33:30,037 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:33:30,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 01:33:30,074 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 24 treesize of output 23 [2024-11-09 01:33:30,139 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:33:30,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2024-11-09 01:33:30,222 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:33:30,222 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 49 treesize of output 39 [2024-11-09 01:33:30,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 49 [2024-11-09 01:33:30,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 62 [2024-11-09 01:33:32,171 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:33:32,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 158 treesize of output 117 [2024-11-09 01:33:32,434 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:33:32,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 164 treesize of output 128 [2024-11-09 01:33:33,211 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:33:33,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 157 treesize of output 75 [2024-11-09 01:33:35,720 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 497 proven. 21 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-11-09 01:33:35,721 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:33:36,882 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:33:36,883 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:33:36,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1871960827] [2024-11-09 01:33:36,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1871960827] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 01:33:36,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 01:33:36,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [32] total 38 [2024-11-09 01:33:36,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614606156] [2024-11-09 01:33:36,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:33:36,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 01:33:36,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:33:36,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 01:33:36,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=1158, Unknown=0, NotChecked=0, Total=1406 [2024-11-09 01:33:36,885 INFO L87 Difference]: Start difference. First operand 872 states and 1152 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:37,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:33:37,781 INFO L93 Difference]: Finished difference Result 1933 states and 2552 transitions. [2024-11-09 01:33:37,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 01:33:37,782 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 149 [2024-11-09 01:33:37,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:33:37,786 INFO L225 Difference]: With dead ends: 1933 [2024-11-09 01:33:37,786 INFO L226 Difference]: Without dead ends: 1267 [2024-11-09 01:33:37,787 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 259 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=274, Invalid=1366, Unknown=0, NotChecked=0, Total=1640 [2024-11-09 01:33:37,788 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 169 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:33:37,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 679 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 01:33:37,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1267 states. [2024-11-09 01:33:37,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1267 to 1095. [2024-11-09 01:33:37,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1095 states, 1003 states have (on average 1.3110667996011964) internal successors, (1315), 1010 states have internal predecessors, (1315), 72 states have call successors, (72), 19 states have call predecessors, (72), 19 states have return successors, (72), 65 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-09 01:33:37,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 1459 transitions. [2024-11-09 01:33:37,851 INFO L78 Accepts]: Start accepts. Automaton has 1095 states and 1459 transitions. Word has length 149 [2024-11-09 01:33:37,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:33:37,852 INFO L471 AbstractCegarLoop]: Abstraction has 1095 states and 1459 transitions. [2024-11-09 01:33:37,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:37,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 1459 transitions. [2024-11-09 01:33:37,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-09 01:33:37,857 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:33:37,857 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:33:37,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-11-09 01:33:38,057 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-09 01:33:38,058 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:33:38,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:33:38,059 INFO L85 PathProgramCache]: Analyzing trace with hash -260933507, now seen corresponding path program 1 times [2024-11-09 01:33:38,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:33:38,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [966950336] [2024-11-09 01:33:38,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:38,060 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:33:38,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:33:38,063 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-09 01:33:38,064 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-09 01:33:38,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:38,278 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-09 01:33:38,282 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:33:38,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 01:33:38,318 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 25 [2024-11-09 01:33:38,404 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:33:38,404 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 36 treesize of output 38 [2024-11-09 01:33:38,512 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:33:38,513 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 46 treesize of output 51 [2024-11-09 01:33:38,658 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:33:38,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 61 treesize of output 54 [2024-11-09 01:33:38,916 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:33:38,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 89 treesize of output 79 [2024-11-09 01:33:39,012 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:33:39,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 117 treesize of output 107 [2024-11-09 01:33:39,379 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:33:39,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 118 treesize of output 54 [2024-11-09 01:33:39,419 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 433 proven. 27 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2024-11-09 01:33:39,419 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:33:39,565 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:33:39,566 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:33:39,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [966950336] [2024-11-09 01:33:39,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [966950336] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 01:33:39,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 01:33:39,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 17 [2024-11-09 01:33:39,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946253439] [2024-11-09 01:33:39,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:33:39,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:33:39,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:33:39,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:33:39,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2024-11-09 01:33:39,567 INFO L87 Difference]: Start difference. First operand 1095 states and 1459 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:39,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:33:39,780 INFO L93 Difference]: Finished difference Result 2370 states and 3142 transitions. [2024-11-09 01:33:39,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:33:39,780 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 149 [2024-11-09 01:33:39,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:33:39,786 INFO L225 Difference]: With dead ends: 2370 [2024-11-09 01:33:39,786 INFO L226 Difference]: Without dead ends: 1552 [2024-11-09 01:33:39,788 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2024-11-09 01:33:39,789 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 71 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:33:39,789 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 400 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:33:39,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1552 states. [2024-11-09 01:33:39,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1552 to 1413. [2024-11-09 01:33:39,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1413 states, 1303 states have (on average 1.3092862624712203) internal successors, (1706), 1312 states have internal predecessors, (1706), 84 states have call successors, (84), 25 states have call predecessors, (84), 25 states have return successors, (84), 75 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-09 01:33:39,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1413 states to 1413 states and 1874 transitions. [2024-11-09 01:33:39,848 INFO L78 Accepts]: Start accepts. Automaton has 1413 states and 1874 transitions. Word has length 149 [2024-11-09 01:33:39,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:33:39,849 INFO L471 AbstractCegarLoop]: Abstraction has 1413 states and 1874 transitions. [2024-11-09 01:33:39,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:39,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1413 states and 1874 transitions. [2024-11-09 01:33:39,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-09 01:33:39,850 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:33:39,850 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:33:39,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2024-11-09 01:33:40,051 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-09 01:33:40,051 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:33:40,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:33:40,052 INFO L85 PathProgramCache]: Analyzing trace with hash 422744069, now seen corresponding path program 1 times [2024-11-09 01:33:40,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:33:40,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [803750513] [2024-11-09 01:33:40,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:40,052 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:33:40,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:33:40,055 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:33:40,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-11-09 01:33:40,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:40,310 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-09 01:33:40,314 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:33:40,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-09 01:33:40,407 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 37 treesize of output 17 [2024-11-09 01:33:40,467 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 32 treesize of output 27 [2024-11-09 01:33:40,543 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:33:40,544 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 47 treesize of output 30 [2024-11-09 01:33:40,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 30 [2024-11-09 01:33:41,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 63 [2024-11-09 01:33:42,627 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:33:42,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 138 treesize of output 89 [2024-11-09 01:33:42,725 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:33:42,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 151 treesize of output 116 [2024-11-09 01:33:43,387 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:33:43,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 175 treesize of output 79 [2024-11-09 01:33:43,668 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 491 proven. 21 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-09 01:33:43,669 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:33:44,349 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:33:44,350 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:33:44,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [803750513] [2024-11-09 01:33:44,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [803750513] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 01:33:44,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 01:33:44,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [32] total 38 [2024-11-09 01:33:44,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470013410] [2024-11-09 01:33:44,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:33:44,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 01:33:44,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:33:44,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 01:33:44,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=1161, Unknown=0, NotChecked=0, Total=1406 [2024-11-09 01:33:44,351 INFO L87 Difference]: Start difference. First operand 1413 states and 1874 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:45,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:33:45,021 INFO L93 Difference]: Finished difference Result 2613 states and 3453 transitions. [2024-11-09 01:33:45,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 01:33:45,022 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 149 [2024-11-09 01:33:45,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:33:45,027 INFO L225 Difference]: With dead ends: 2613 [2024-11-09 01:33:45,027 INFO L226 Difference]: Without dead ends: 1552 [2024-11-09 01:33:45,029 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 257 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=271, Invalid=1369, Unknown=0, NotChecked=0, Total=1640 [2024-11-09 01:33:45,029 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 66 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:33:45,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 844 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 01:33:45,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1552 states. [2024-11-09 01:33:45,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1552 to 1396. [2024-11-09 01:33:45,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1396 states, 1285 states have (on average 1.306614785992218) internal successors, (1679), 1294 states have internal predecessors, (1679), 84 states have call successors, (84), 26 states have call predecessors, (84), 26 states have return successors, (84), 75 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-09 01:33:45,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1396 states to 1396 states and 1847 transitions. [2024-11-09 01:33:45,071 INFO L78 Accepts]: Start accepts. Automaton has 1396 states and 1847 transitions. Word has length 149 [2024-11-09 01:33:45,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:33:45,072 INFO L471 AbstractCegarLoop]: Abstraction has 1396 states and 1847 transitions. [2024-11-09 01:33:45,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:45,072 INFO L276 IsEmpty]: Start isEmpty. Operand 1396 states and 1847 transitions. [2024-11-09 01:33:45,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-09 01:33:45,073 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:33:45,073 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:33:45,080 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2024-11-09 01:33:45,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:33:45,278 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:33:45,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:33:45,278 INFO L85 PathProgramCache]: Analyzing trace with hash -260398211, now seen corresponding path program 1 times [2024-11-09 01:33:45,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:33:45,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1064197103] [2024-11-09 01:33:45,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:45,279 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:33:45,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:33:45,280 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:33:45,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-11-09 01:33:45,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:45,534 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-09 01:33:45,537 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:33:45,543 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-09 01:33:45,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 26 treesize of output 25 [2024-11-09 01:33:45,648 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:33:45,648 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 36 treesize of output 38 [2024-11-09 01:33:45,766 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:33:45,766 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 46 treesize of output 51 [2024-11-09 01:33:45,909 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:33:45,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 61 treesize of output 54 [2024-11-09 01:33:46,169 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:33:46,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 79 treesize of output 75 [2024-11-09 01:33:46,287 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:33:46,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 102 treesize of output 104 [2024-11-09 01:33:46,680 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:33:46,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 108 treesize of output 50 [2024-11-09 01:33:46,719 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 433 proven. 27 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2024-11-09 01:33:46,719 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:33:46,861 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:33:46,861 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:33:46,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1064197103] [2024-11-09 01:33:46,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1064197103] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 01:33:46,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 01:33:46,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 17 [2024-11-09 01:33:46,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139081494] [2024-11-09 01:33:46,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:33:46,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:33:46,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:33:46,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:33:46,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2024-11-09 01:33:46,863 INFO L87 Difference]: Start difference. First operand 1396 states and 1847 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:47,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:33:47,061 INFO L93 Difference]: Finished difference Result 2517 states and 3327 transitions. [2024-11-09 01:33:47,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:33:47,061 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 149 [2024-11-09 01:33:47,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:33:47,066 INFO L225 Difference]: With dead ends: 2517 [2024-11-09 01:33:47,066 INFO L226 Difference]: Without dead ends: 1477 [2024-11-09 01:33:47,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2024-11-09 01:33:47,067 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 69 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:33:47,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 558 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:33:47,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1477 states. [2024-11-09 01:33:47,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1477 to 1274. [2024-11-09 01:33:47,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1274 states, 1192 states have (on average 1.3171140939597314) internal successors, (1570), 1197 states have internal predecessors, (1570), 62 states have call successors, (62), 19 states have call predecessors, (62), 19 states have return successors, (62), 57 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-09 01:33:47,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 1694 transitions. [2024-11-09 01:33:47,104 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 1694 transitions. Word has length 149 [2024-11-09 01:33:47,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:33:47,104 INFO L471 AbstractCegarLoop]: Abstraction has 1274 states and 1694 transitions. [2024-11-09 01:33:47,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:47,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 1694 transitions. [2024-11-09 01:33:47,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-09 01:33:47,105 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:33:47,105 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:33:47,116 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 (23)] Forceful destruction successful, exit code 0 [2024-11-09 01:33:47,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:33:47,310 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:33:47,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:33:47,310 INFO L85 PathProgramCache]: Analyzing trace with hash 440666367, now seen corresponding path program 1 times [2024-11-09 01:33:47,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:33:47,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1756843286] [2024-11-09 01:33:47,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:47,311 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:33:47,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:33:47,312 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:33:47,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 (24)] Waiting until timeout for monitored process [2024-11-09 01:33:47,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:47,655 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-09 01:33:47,660 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:33:47,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 01:33:47,700 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 29 treesize of output 13 [2024-11-09 01:33:47,784 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:33:47,784 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 35 treesize of output 37 [2024-11-09 01:33:47,917 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:33:47,917 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 45 treesize of output 50 [2024-11-09 01:33:48,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 63 [2024-11-09 01:33:48,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 86 [2024-11-09 01:33:50,621 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:33:50,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 179 treesize of output 135 [2024-11-09 01:33:50,989 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:33:50,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 185 treesize of output 146 [2024-11-09 01:33:52,310 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:33:52,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 220 treesize of output 96 [2024-11-09 01:33:55,074 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 504 proven. 33 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-11-09 01:33:55,075 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:33:56,509 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:33:56,509 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:33:56,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1756843286] [2024-11-09 01:33:56,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1756843286] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 01:33:56,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 01:33:56,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [37] total 43 [2024-11-09 01:33:56,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596335411] [2024-11-09 01:33:56,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:33:56,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 01:33:56,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:33:56,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 01:33:56,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=1477, Unknown=0, NotChecked=0, Total=1806 [2024-11-09 01:33:56,511 INFO L87 Difference]: Start difference. First operand 1274 states and 1694 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:57,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:33:57,735 INFO L93 Difference]: Finished difference Result 2307 states and 3059 transitions. [2024-11-09 01:33:57,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 01:33:57,737 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 149 [2024-11-09 01:33:57,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:33:57,741 INFO L225 Difference]: With dead ends: 2307 [2024-11-09 01:33:57,741 INFO L226 Difference]: Without dead ends: 1389 [2024-11-09 01:33:57,743 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=357, Invalid=1713, Unknown=0, NotChecked=0, Total=2070 [2024-11-09 01:33:57,743 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 107 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 01:33:57,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 714 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 01:33:57,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states. [2024-11-09 01:33:57,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 1247. [2024-11-09 01:33:57,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1247 states, 1165 states have (on average 1.3167381974248926) internal successors, (1534), 1170 states have internal predecessors, (1534), 62 states have call successors, (62), 19 states have call predecessors, (62), 19 states have return successors, (62), 57 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-09 01:33:57,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1247 states to 1247 states and 1658 transitions. [2024-11-09 01:33:57,803 INFO L78 Accepts]: Start accepts. Automaton has 1247 states and 1658 transitions. Word has length 149 [2024-11-09 01:33:57,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:33:57,804 INFO L471 AbstractCegarLoop]: Abstraction has 1247 states and 1658 transitions. [2024-11-09 01:33:57,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:57,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1247 states and 1658 transitions. [2024-11-09 01:33:57,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-09 01:33:57,805 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:33:57,805 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:33:57,811 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 (24)] Ended with exit code 0 [2024-11-09 01:33:58,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:33:58,006 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:33:58,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:33:58,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1804402313, now seen corresponding path program 1 times [2024-11-09 01:33:58,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:33:58,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [996700783] [2024-11-09 01:33:58,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:58,007 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:33:58,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:33:58,009 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:33:58,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2024-11-09 01:33:58,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:58,274 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-09 01:33:58,278 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:33:58,282 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-09 01:33:58,314 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 24 treesize of output 23 [2024-11-09 01:33:58,457 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:33:58,458 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 50 treesize of output 31 [2024-11-09 01:33:58,541 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:33:58,541 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 50 treesize of output 31 [2024-11-09 01:33:58,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 31 [2024-11-09 01:33:59,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 64 [2024-11-09 01:34:00,915 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:34:00,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 153 treesize of output 94 [2024-11-09 01:34:01,257 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:34:01,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 166 treesize of output 112 [2024-11-09 01:34:02,432 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:34:02,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 174 treesize of output 80 [2024-11-09 01:34:06,672 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 468 proven. 33 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-11-09 01:34:06,673 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:34:08,645 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:34:08,645 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:34:08,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [996700783] [2024-11-09 01:34:08,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [996700783] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 01:34:08,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 01:34:08,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [35] total 41 [2024-11-09 01:34:08,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694641384] [2024-11-09 01:34:08,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:34:08,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 01:34:08,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:34:08,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 01:34:08,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=1365, Unknown=0, NotChecked=0, Total=1640 [2024-11-09 01:34:08,651 INFO L87 Difference]: Start difference. First operand 1247 states and 1658 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:34:10,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:34:10,427 INFO L93 Difference]: Finished difference Result 2201 states and 2926 transitions. [2024-11-09 01:34:10,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 01:34:10,428 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 149 [2024-11-09 01:34:10,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:34:10,433 INFO L225 Difference]: With dead ends: 2201 [2024-11-09 01:34:10,433 INFO L226 Difference]: Without dead ends: 1310 [2024-11-09 01:34:10,435 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 253 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=303, Invalid=1589, Unknown=0, NotChecked=0, Total=1892 [2024-11-09 01:34:10,436 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 209 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:34:10,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 791 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 01:34:10,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1310 states. [2024-11-09 01:34:10,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1310 to 1080. [2024-11-09 01:34:10,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1080 states, 1028 states have (on average 1.33852140077821) internal successors, (1376), 1029 states have internal predecessors, (1376), 40 states have call successors, (40), 11 states have call predecessors, (40), 11 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-09 01:34:10,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 1456 transitions. [2024-11-09 01:34:10,473 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 1456 transitions. Word has length 149 [2024-11-09 01:34:10,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:34:10,474 INFO L471 AbstractCegarLoop]: Abstraction has 1080 states and 1456 transitions. [2024-11-09 01:34:10,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:34:10,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 1456 transitions. [2024-11-09 01:34:10,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-09 01:34:10,475 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:34:10,476 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:34:10,482 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 (25)] Forceful destruction successful, exit code 0 [2024-11-09 01:34:10,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:34:10,678 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:34:10,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:34:10,678 INFO L85 PathProgramCache]: Analyzing trace with hash 166006165, now seen corresponding path program 1 times [2024-11-09 01:34:10,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:34:10,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [122634951] [2024-11-09 01:34:10,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:34:10,680 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:34:10,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:34:10,682 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:34:10,683 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 (26)] Waiting until timeout for monitored process [2024-11-09 01:34:10,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:10,837 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 01:34:10,839 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:34:10,920 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:34:10,920 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:34:10,920 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:34:10,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [122634951] [2024-11-09 01:34:10,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [122634951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:34:10,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:34:10,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:34:10,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984065796] [2024-11-09 01:34:10,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:34:10,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:34:10,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:34:10,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:34:10,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:34:10,922 INFO L87 Difference]: Start difference. First operand 1080 states and 1456 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:34:11,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:34:11,345 INFO L93 Difference]: Finished difference Result 2140 states and 2890 transitions. [2024-11-09 01:34:11,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:34:11,346 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 150 [2024-11-09 01:34:11,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:34:11,350 INFO L225 Difference]: With dead ends: 2140 [2024-11-09 01:34:11,350 INFO L226 Difference]: Without dead ends: 1416 [2024-11-09 01:34:11,351 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:34:11,352 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 96 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 01:34:11,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 440 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 01:34:11,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2024-11-09 01:34:11,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 1224. [2024-11-09 01:34:11,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1224 states, 1172 states have (on average 1.341296928327645) internal successors, (1572), 1173 states have internal predecessors, (1572), 40 states have call successors, (40), 11 states have call predecessors, (40), 11 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-09 01:34:11,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 1652 transitions. [2024-11-09 01:34:11,395 INFO L78 Accepts]: Start accepts. Automaton has 1224 states and 1652 transitions. Word has length 150 [2024-11-09 01:34:11,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:34:11,395 INFO L471 AbstractCegarLoop]: Abstraction has 1224 states and 1652 transitions. [2024-11-09 01:34:11,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:34:11,396 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 1652 transitions. [2024-11-09 01:34:11,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-09 01:34:11,397 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:34:11,397 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:34:11,402 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 (26)] Forceful destruction successful, exit code 0 [2024-11-09 01:34:11,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:34:11,598 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:34:11,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:34:11,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1371848033, now seen corresponding path program 1 times [2024-11-09 01:34:11,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:34:11,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1987151240] [2024-11-09 01:34:11,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:34:11,599 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:34:11,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:34:11,602 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:34:11,603 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 (27)] Waiting until timeout for monitored process [2024-11-09 01:34:11,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:11,879 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-09 01:34:11,884 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:34:11,887 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-09 01:34:11,889 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-09 01:34:11,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-09 01:34:11,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2024-11-09 01:34:12,076 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:34:12,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 60 treesize of output 53 [2024-11-09 01:34:12,108 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:34:12,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 73 treesize of output 87 [2024-11-09 01:34:12,340 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:34:12,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 89 treesize of output 37 [2024-11-09 01:34:12,897 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2024-11-09 01:34:12,897 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:34:12,897 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:34:12,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1987151240] [2024-11-09 01:34:12,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1987151240] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:34:12,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:34:12,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 01:34:12,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289554162] [2024-11-09 01:34:12,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:34:12,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 01:34:12,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:34:12,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 01:34:12,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:34:12,900 INFO L87 Difference]: Start difference. First operand 1224 states and 1652 transitions. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-09 01:34:19,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:34:19,558 INFO L93 Difference]: Finished difference Result 2756 states and 3710 transitions. [2024-11-09 01:34:19,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 01:34:19,559 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 151 [2024-11-09 01:34:19,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:34:19,564 INFO L225 Difference]: With dead ends: 2756 [2024-11-09 01:34:19,564 INFO L226 Difference]: Without dead ends: 1924 [2024-11-09 01:34:19,565 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:34:19,568 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 331 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:34:19,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 530 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2024-11-09 01:34:19,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1924 states. [2024-11-09 01:34:19,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1924 to 1812. [2024-11-09 01:34:19,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1812 states, 1739 states have (on average 1.3335250143760782) internal successors, (2319), 1742 states have internal predecessors, (2319), 54 states have call successors, (54), 18 states have call predecessors, (54), 18 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-09 01:34:19,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1812 states to 1812 states and 2427 transitions. [2024-11-09 01:34:19,615 INFO L78 Accepts]: Start accepts. Automaton has 1812 states and 2427 transitions. Word has length 151 [2024-11-09 01:34:19,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:34:19,615 INFO L471 AbstractCegarLoop]: Abstraction has 1812 states and 2427 transitions. [2024-11-09 01:34:19,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-09 01:34:19,616 INFO L276 IsEmpty]: Start isEmpty. Operand 1812 states and 2427 transitions. [2024-11-09 01:34:19,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-09 01:34:19,617 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:34:19,617 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:34:19,623 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Ended with exit code 0 [2024-11-09 01:34:19,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:34:19,818 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:34:19,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:34:19,818 INFO L85 PathProgramCache]: Analyzing trace with hash -691789663, now seen corresponding path program 1 times [2024-11-09 01:34:19,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:34:19,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [73932982] [2024-11-09 01:34:19,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:34:19,819 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:34:19,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:34:19,821 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:34:19,826 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 (28)] Waiting until timeout for monitored process [2024-11-09 01:34:20,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:20,046 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-09 01:34:20,049 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:34:20,055 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-09 01:34:20,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-09 01:34:20,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-11-09 01:34:20,138 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:34:20,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2024-11-09 01:34:20,166 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:34:20,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 73 [2024-11-09 01:34:20,383 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:34:20,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 79 treesize of output 33 [2024-11-09 01:34:20,439 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2024-11-09 01:34:20,439 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:34:20,439 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:34:20,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [73932982] [2024-11-09 01:34:20,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [73932982] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:34:20,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:34:20,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 01:34:20,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133280898] [2024-11-09 01:34:20,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:34:20,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 01:34:20,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:34:20,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 01:34:20,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-09 01:34:20,440 INFO L87 Difference]: Start difference. First operand 1812 states and 2427 transitions. Second operand has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-09 01:34:21,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:34:21,706 INFO L93 Difference]: Finished difference Result 3194 states and 4293 transitions. [2024-11-09 01:34:21,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 01:34:21,706 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 151 [2024-11-09 01:34:21,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:34:21,711 INFO L225 Difference]: With dead ends: 3194 [2024-11-09 01:34:21,711 INFO L226 Difference]: Without dead ends: 1932 [2024-11-09 01:34:21,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2024-11-09 01:34:21,713 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 241 mSDsluCounter, 975 mSDsCounter, 0 mSdLazyCounter, 730 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 1149 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:34:21,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 1149 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 730 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 01:34:21,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1932 states. [2024-11-09 01:34:21,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1932 to 1870. [2024-11-09 01:34:21,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1870 states, 1794 states have (on average 1.3288740245261985) internal successors, (2384), 1797 states have internal predecessors, (2384), 56 states have call successors, (56), 19 states have call predecessors, (56), 19 states have return successors, (56), 53 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-09 01:34:21,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1870 states to 1870 states and 2496 transitions. [2024-11-09 01:34:21,763 INFO L78 Accepts]: Start accepts. Automaton has 1870 states and 2496 transitions. Word has length 151 [2024-11-09 01:34:21,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:34:21,764 INFO L471 AbstractCegarLoop]: Abstraction has 1870 states and 2496 transitions. [2024-11-09 01:34:21,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-09 01:34:21,764 INFO L276 IsEmpty]: Start isEmpty. Operand 1870 states and 2496 transitions. [2024-11-09 01:34:21,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-09 01:34:21,765 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:34:21,765 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:34:21,771 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 (28)] Forceful destruction successful, exit code 0 [2024-11-09 01:34:21,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:34:21,966 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:34:21,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:34:21,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1394480287, now seen corresponding path program 1 times [2024-11-09 01:34:21,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:34:21,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1927396922] [2024-11-09 01:34:21,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:34:21,968 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:34:21,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:34:21,970 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:34:21,971 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 (29)] Waiting until timeout for monitored process [2024-11-09 01:34:22,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:22,227 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 01:34:22,231 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:34:22,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-09 01:34:22,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2024-11-09 01:34:22,352 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:34:22,352 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 35 treesize of output 37 [2024-11-09 01:34:22,460 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:34:22,461 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 50 treesize of output 40 [2024-11-09 01:34:22,623 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:34:22,623 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 54 treesize of output 53 [2024-11-09 01:34:22,676 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:34:22,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 82 treesize of output 90 [2024-11-09 01:34:23,048 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:34:23,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 94 treesize of output 42 [2024-11-09 01:34:23,130 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2024-11-09 01:34:23,130 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:34:23,130 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:34:23,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1927396922] [2024-11-09 01:34:23,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1927396922] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:34:23,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:34:23,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 01:34:23,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931142377] [2024-11-09 01:34:23,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:34:23,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 01:34:23,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:34:23,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 01:34:23,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-11-09 01:34:23,132 INFO L87 Difference]: Start difference. First operand 1870 states and 2496 transitions. Second operand has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 4 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2024-11-09 01:34:24,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:34:24,626 INFO L93 Difference]: Finished difference Result 3382 states and 4516 transitions. [2024-11-09 01:34:24,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 01:34:24,626 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 4 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) Word has length 151 [2024-11-09 01:34:24,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:34:24,632 INFO L225 Difference]: With dead ends: 3382 [2024-11-09 01:34:24,632 INFO L226 Difference]: Without dead ends: 2062 [2024-11-09 01:34:24,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2024-11-09 01:34:24,634 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 317 mSDsluCounter, 934 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 1099 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:34:24,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 1099 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 01:34:24,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2062 states. [2024-11-09 01:34:24,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2062 to 1992. [2024-11-09 01:34:24,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1992 states, 1896 states have (on average 1.3185654008438819) internal successors, (2500), 1901 states have internal predecessors, (2500), 70 states have call successors, (70), 25 states have call predecessors, (70), 25 states have return successors, (70), 65 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-09 01:34:24,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1992 states to 1992 states and 2640 transitions. [2024-11-09 01:34:24,738 INFO L78 Accepts]: Start accepts. Automaton has 1992 states and 2640 transitions. Word has length 151 [2024-11-09 01:34:24,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:34:24,739 INFO L471 AbstractCegarLoop]: Abstraction has 1992 states and 2640 transitions. [2024-11-09 01:34:24,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 4 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2024-11-09 01:34:24,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1992 states and 2640 transitions. [2024-11-09 01:34:24,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-09 01:34:24,741 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:34:24,741 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:34:24,748 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 (29)] Forceful destruction successful, exit code 0 [2024-11-09 01:34:24,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:34:24,945 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:34:24,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:34:24,945 INFO L85 PathProgramCache]: Analyzing trace with hash -714421917, now seen corresponding path program 1 times [2024-11-09 01:34:24,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:34:24,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1731829330] [2024-11-09 01:34:24,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:34:24,946 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:34:24,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:34:24,948 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:34:24,949 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 (30)] Waiting until timeout for monitored process [2024-11-09 01:34:25,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:25,179 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-09 01:34:25,185 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:34:25,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-09 01:34:25,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-11-09 01:34:25,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-11-09 01:34:25,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2024-11-09 01:34:25,487 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:34:25,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 43 [2024-11-09 01:34:25,548 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:34:25,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 72 treesize of output 77 [2024-11-09 01:34:25,766 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:34:25,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 88 treesize of output 36 [2024-11-09 01:34:25,800 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 368 proven. 0 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2024-11-09 01:34:25,800 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:34:25,800 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:34:25,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1731829330] [2024-11-09 01:34:25,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1731829330] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:34:25,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:34:25,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 01:34:25,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766455718] [2024-11-09 01:34:25,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:34:25,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 01:34:25,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:34:25,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 01:34:25,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:34:25,802 INFO L87 Difference]: Start difference. First operand 1992 states and 2640 transitions. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18)