./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-18.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/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-18.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 34c00af4b4663198525b0b7086d994deb20901b2017b1e6c2fe4ceb71d985d42 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 12:30:53,746 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 12:30:53,798 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 12:30:53,802 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 12:30:53,802 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 12:30:53,821 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 12:30:53,822 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 12:30:53,822 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 12:30:53,823 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 12:30:53,826 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 12:30:53,826 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 12:30:53,827 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 12:30:53,827 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 12:30:53,827 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 12:30:53,827 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 12:30:53,828 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 12:30:53,828 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 12:30:53,828 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 12:30:53,829 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 12:30:53,829 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 12:30:53,829 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 12:30:53,830 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 12:30:53,830 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 12:30:53,830 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 12:30:53,830 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 12:30:53,831 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 12:30:53,831 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 12:30:53,831 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 12:30:53,831 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 12:30:53,831 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 12:30:53,832 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 12:30:53,832 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 12:30:53,833 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 12:30:53,833 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 12:30:53,833 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 12:30:53,833 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 12:30:53,833 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 12:30:53,833 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 12:30:53,833 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 12:30:53,834 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 12:30:53,834 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 12:30:53,834 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 12:30:53,835 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 -> 34c00af4b4663198525b0b7086d994deb20901b2017b1e6c2fe4ceb71d985d42 [2024-11-22 12:30:54,030 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 12:30:54,045 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 12:30:54,046 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 12:30:54,047 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 12:30:54,047 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 12:30:54,048 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-18.i [2024-11-22 12:30:55,319 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 12:30:55,503 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 12:30:55,503 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-18.i [2024-11-22 12:30:55,513 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d55dfb96/6d05c859a66f44c4a8dfcc9c0558cb4e/FLAGd47c0be8f [2024-11-22 12:30:55,529 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d55dfb96/6d05c859a66f44c4a8dfcc9c0558cb4e [2024-11-22 12:30:55,532 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 12:30:55,534 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 12:30:55,535 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 12:30:55,536 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 12:30:55,540 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 12:30:55,541 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:30:55" (1/1) ... [2024-11-22 12:30:55,543 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@82abf00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:30:55, skipping insertion in model container [2024-11-22 12:30:55,543 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:30:55" (1/1) ... [2024-11-22 12:30:55,566 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 12:30:55,735 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-18.i[916,929] [2024-11-22 12:30:55,795 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 12:30:55,820 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 12:30:55,829 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-18.i[916,929] [2024-11-22 12:30:55,855 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 12:30:55,870 INFO L204 MainTranslator]: Completed translation [2024-11-22 12:30:55,871 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:30:55 WrapperNode [2024-11-22 12:30:55,871 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 12:30:55,872 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 12:30:55,872 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 12:30:55,872 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 12:30:55,877 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:30:55" (1/1) ... [2024-11-22 12:30:55,887 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:30:55" (1/1) ... [2024-11-22 12:30:55,915 INFO L138 Inliner]: procedures = 29, calls = 143, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 481 [2024-11-22 12:30:55,916 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 12:30:55,916 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 12:30:55,916 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 12:30:55,917 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 12:30:55,925 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:30:55" (1/1) ... [2024-11-22 12:30:55,926 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:30:55" (1/1) ... [2024-11-22 12:30:55,932 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:30:55" (1/1) ... [2024-11-22 12:30:55,956 INFO L175 MemorySlicer]: Split 115 memory accesses to 6 slices as follows [2, 6, 29, 22, 46, 10]. 40 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 3, 2, 3, 1]. The 13 writes are split as follows [0, 1, 4, 2, 4, 2]. [2024-11-22 12:30:55,957 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:30:55" (1/1) ... [2024-11-22 12:30:55,957 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:30:55" (1/1) ... [2024-11-22 12:30:55,976 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:30:55" (1/1) ... [2024-11-22 12:30:55,983 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:30:55" (1/1) ... [2024-11-22 12:30:55,991 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:30:55" (1/1) ... [2024-11-22 12:30:55,993 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:30:55" (1/1) ... [2024-11-22 12:30:55,998 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 12:30:55,998 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 12:30:55,999 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 12:30:55,999 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 12:30:55,999 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:30:55" (1/1) ... [2024-11-22 12:30:56,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 12:30:56,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 12:30:56,043 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-22 12:30:56,053 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-22 12:30:56,103 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 12:30:56,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-22 12:30:56,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-22 12:30:56,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-22 12:30:56,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-22 12:30:56,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-22 12:30:56,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-22 12:30:56,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-22 12:30:56,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-22 12:30:56,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-22 12:30:56,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-22 12:30:56,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-22 12:30:56,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-22 12:30:56,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-22 12:30:56,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-22 12:30:56,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-22 12:30:56,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-22 12:30:56,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-22 12:30:56,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-22 12:30:56,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-22 12:30:56,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-22 12:30:56,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-22 12:30:56,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-22 12:30:56,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-22 12:30:56,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-22 12:30:56,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-22 12:30:56,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-22 12:30:56,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-22 12:30:56,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-22 12:30:56,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-22 12:30:56,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-22 12:30:56,110 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 12:30:56,110 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 12:30:56,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 12:30:56,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-22 12:30:56,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-22 12:30:56,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-22 12:30:56,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-22 12:30:56,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-22 12:30:56,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 12:30:56,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 12:30:56,213 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 12:30:56,215 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 12:30:56,621 INFO L? ?]: Removed 145 outVars from TransFormulas that were not future-live. [2024-11-22 12:30:56,622 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 12:30:56,638 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 12:30:56,639 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 12:30:56,639 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:30:56 BoogieIcfgContainer [2024-11-22 12:30:56,640 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 12:30:56,641 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 12:30:56,641 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 12:30:56,645 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 12:30:56,646 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 12:30:55" (1/3) ... [2024-11-22 12:30:56,646 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45223c48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:30:56, skipping insertion in model container [2024-11-22 12:30:56,646 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:30:55" (2/3) ... [2024-11-22 12:30:56,646 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45223c48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:30:56, skipping insertion in model container [2024-11-22 12:30:56,647 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:30:56" (3/3) ... [2024-11-22 12:30:56,647 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-18.i [2024-11-22 12:30:56,660 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 12:30:56,661 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 12:30:56,716 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 12:30:56,722 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;@5be2eb4c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 12:30:56,722 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 12:30:56,726 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 93 states have (on average 1.4623655913978495) internal successors, (136), 94 states have internal predecessors, (136), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-22 12:30:56,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-22 12:30:56,737 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:30:56,738 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:30:56,739 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:30:56,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:30:56,743 INFO L85 PathProgramCache]: Analyzing trace with hash 2059805146, now seen corresponding path program 1 times [2024-11-22 12:30:56,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:30:56,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971275031] [2024-11-22 12:30:56,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:30:56,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:30:56,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:30:57,025 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2024-11-22 12:30:57,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:30:57,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971275031] [2024-11-22 12:30:57,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971275031] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 12:30:57,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502150572] [2024-11-22 12:30:57,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:30:57,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 12:30:57,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 12:30:57,031 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 12:30:57,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-22 12:30:57,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:30:57,262 INFO L255 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 12:30:57,267 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:30:57,281 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2024-11-22 12:30:57,281 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:30:57,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [502150572] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:30:57,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 12:30:57,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-22 12:30:57,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013748050] [2024-11-22 12:30:57,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:30:57,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 12:30:57,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:30:57,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 12:30:57,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 12:30:57,307 INFO L87 Difference]: Start difference. First operand has 108 states, 93 states have (on average 1.4623655913978495) internal successors, (136), 94 states have internal predecessors, (136), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-22 12:30:57,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:30:57,332 INFO L93 Difference]: Finished difference Result 209 states and 326 transitions. [2024-11-22 12:30:57,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 12:30:57,334 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 107 [2024-11-22 12:30:57,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:30:57,343 INFO L225 Difference]: With dead ends: 209 [2024-11-22 12:30:57,343 INFO L226 Difference]: Without dead ends: 104 [2024-11-22 12:30:57,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 108 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-22 12:30:57,347 INFO L432 NwaCegarLoop]: 153 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, 153 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-22 12:30:57,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:30:57,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-22 12:30:57,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-22 12:30:57,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 90 states have (on average 1.4333333333333333) internal successors, (129), 90 states have internal predecessors, (129), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-22 12:30:57,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 153 transitions. [2024-11-22 12:30:57,378 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 153 transitions. Word has length 107 [2024-11-22 12:30:57,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:30:57,379 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 153 transitions. [2024-11-22 12:30:57,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-22 12:30:57,379 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 153 transitions. [2024-11-22 12:30:57,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-22 12:30:57,382 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:30:57,382 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:30:57,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-22 12:30:57,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-22 12:30:57,587 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:30:57,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:30:57,588 INFO L85 PathProgramCache]: Analyzing trace with hash -528351354, now seen corresponding path program 1 times [2024-11-22 12:30:57,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:30:57,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010730282] [2024-11-22 12:30:57,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:30:57,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:30:57,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:30:57,753 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-22 12:30:57,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:30:57,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010730282] [2024-11-22 12:30:57,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010730282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:30:57,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:30:57,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 12:30:57,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233740938] [2024-11-22 12:30:57,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:30:57,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 12:30:57,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:30:57,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 12:30:57,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 12:30:57,756 INFO L87 Difference]: Start difference. First operand 104 states and 153 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-22 12:30:57,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:30:57,781 INFO L93 Difference]: Finished difference Result 207 states and 306 transitions. [2024-11-22 12:30:57,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 12:30:57,781 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 107 [2024-11-22 12:30:57,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:30:57,782 INFO L225 Difference]: With dead ends: 207 [2024-11-22 12:30:57,782 INFO L226 Difference]: Without dead ends: 106 [2024-11-22 12:30:57,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 12:30:57,784 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:30:57,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 442 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:30:57,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-22 12:30:57,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-22 12:30:57,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 92 states have (on average 1.423913043478261) internal successors, (131), 92 states have internal predecessors, (131), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-22 12:30:57,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 155 transitions. [2024-11-22 12:30:57,796 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 155 transitions. Word has length 107 [2024-11-22 12:30:57,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:30:57,797 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 155 transitions. [2024-11-22 12:30:57,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-22 12:30:57,797 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 155 transitions. [2024-11-22 12:30:57,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-22 12:30:57,798 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:30:57,798 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:30:57,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 12:30:57,799 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:30:57,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:30:57,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1889552712, now seen corresponding path program 1 times [2024-11-22 12:30:57,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:30:57,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635011910] [2024-11-22 12:30:57,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:30:57,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:30:57,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:30:58,353 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-22 12:30:58,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:30:58,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635011910] [2024-11-22 12:30:58,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635011910] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:30:58,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:30:58,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 12:30:58,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449245725] [2024-11-22 12:30:58,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:30:58,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 12:30:58,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:30:58,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 12:30:58,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-22 12:30:58,360 INFO L87 Difference]: Start difference. First operand 106 states and 155 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 12:30:58,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:30:58,576 INFO L93 Difference]: Finished difference Result 312 states and 459 transitions. [2024-11-22 12:30:58,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 12:30:58,577 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), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 107 [2024-11-22 12:30:58,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:30:58,580 INFO L225 Difference]: With dead ends: 312 [2024-11-22 12:30:58,581 INFO L226 Difference]: Without dead ends: 209 [2024-11-22 12:30:58,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-22 12:30:58,583 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 115 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 12:30:58,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 445 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 12:30:58,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-22 12:30:58,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 204. [2024-11-22 12:30:58,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 177 states have (on average 1.423728813559322) internal successors, (252), 177 states have internal predecessors, (252), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-22 12:30:58,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 300 transitions. [2024-11-22 12:30:58,612 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 300 transitions. Word has length 107 [2024-11-22 12:30:58,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:30:58,613 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 300 transitions. [2024-11-22 12:30:58,613 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), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 12:30:58,613 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 300 transitions. [2024-11-22 12:30:58,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-22 12:30:58,617 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:30:58,618 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:30:58,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 12:30:58,618 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:30:58,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:30:58,618 INFO L85 PathProgramCache]: Analyzing trace with hash 724231687, now seen corresponding path program 1 times [2024-11-22 12:30:58,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:30:58,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681376511] [2024-11-22 12:30:58,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:30:58,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:30:58,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:30:58,873 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-22 12:30:58,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:30:58,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681376511] [2024-11-22 12:30:58,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681376511] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:30:58,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:30:58,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 12:30:58,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958380615] [2024-11-22 12:30:58,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:30:58,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 12:30:58,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:30:58,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 12:30:58,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-22 12:30:58,875 INFO L87 Difference]: Start difference. First operand 204 states and 300 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 12:30:59,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:30:59,027 INFO L93 Difference]: Finished difference Result 410 states and 603 transitions. [2024-11-22 12:30:59,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 12:30:59,027 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2024-11-22 12:30:59,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:30:59,029 INFO L225 Difference]: With dead ends: 410 [2024-11-22 12:30:59,029 INFO L226 Difference]: Without dead ends: 209 [2024-11-22 12:30:59,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-22 12:30:59,030 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 108 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 12:30:59,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 529 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 12:30:59,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-22 12:30:59,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 204. [2024-11-22 12:30:59,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 177 states have (on average 1.4180790960451977) internal successors, (251), 177 states have internal predecessors, (251), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-22 12:30:59,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 299 transitions. [2024-11-22 12:30:59,041 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 299 transitions. Word has length 108 [2024-11-22 12:30:59,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:30:59,042 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 299 transitions. [2024-11-22 12:30:59,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 12:30:59,042 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 299 transitions. [2024-11-22 12:30:59,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-22 12:30:59,043 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:30:59,043 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:30:59,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 12:30:59,043 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:30:59,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:30:59,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1432431047, now seen corresponding path program 1 times [2024-11-22 12:30:59,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:30:59,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161572133] [2024-11-22 12:30:59,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:30:59,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:30:59,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:30:59,268 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-22 12:30:59,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:30:59,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161572133] [2024-11-22 12:30:59,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161572133] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:30:59,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:30:59,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 12:30:59,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042211721] [2024-11-22 12:30:59,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:30:59,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 12:30:59,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:30:59,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 12:30:59,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 12:30:59,271 INFO L87 Difference]: Start difference. First operand 204 states and 299 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 12:30:59,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:30:59,341 INFO L93 Difference]: Finished difference Result 309 states and 454 transitions. [2024-11-22 12:30:59,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 12:30:59,342 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2024-11-22 12:30:59,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:30:59,343 INFO L225 Difference]: With dead ends: 309 [2024-11-22 12:30:59,343 INFO L226 Difference]: Without dead ends: 206 [2024-11-22 12:30:59,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 12:30:59,344 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 5 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 12:30:59,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 524 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 12:30:59,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-11-22 12:30:59,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2024-11-22 12:30:59,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 178 states have (on average 1.4157303370786516) internal successors, (252), 178 states have internal predecessors, (252), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-22 12:30:59,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 300 transitions. [2024-11-22 12:30:59,353 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 300 transitions. Word has length 108 [2024-11-22 12:30:59,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:30:59,353 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 300 transitions. [2024-11-22 12:30:59,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 12:30:59,353 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 300 transitions. [2024-11-22 12:30:59,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-22 12:30:59,354 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:30:59,354 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:30:59,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 12:30:59,354 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:30:59,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:30:59,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1274188347, now seen corresponding path program 1 times [2024-11-22 12:30:59,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:30:59,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369918547] [2024-11-22 12:30:59,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:30:59,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:30:59,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:31:00,155 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-22 12:31:00,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:31:00,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369918547] [2024-11-22 12:31:00,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369918547] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:31:00,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:31:00,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-22 12:31:00,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590567991] [2024-11-22 12:31:00,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:31:00,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-22 12:31:00,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:31:00,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-22 12:31:00,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-22 12:31:00,158 INFO L87 Difference]: Start difference. First operand 205 states and 300 transitions. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-22 12:31:01,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:31:01,265 INFO L93 Difference]: Finished difference Result 425 states and 625 transitions. [2024-11-22 12:31:01,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-22 12:31:01,266 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 108 [2024-11-22 12:31:01,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:31:01,268 INFO L225 Difference]: With dead ends: 425 [2024-11-22 12:31:01,268 INFO L226 Difference]: Without dead ends: 321 [2024-11-22 12:31:01,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-11-22 12:31:01,273 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 452 mSDsluCounter, 947 mSDsCounter, 0 mSdLazyCounter, 1042 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 1134 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-22 12:31:01,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 1134 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1042 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-22 12:31:01,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-11-22 12:31:01,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 304. [2024-11-22 12:31:01,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 264 states have (on average 1.4166666666666667) internal successors, (374), 264 states have internal predecessors, (374), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-22 12:31:01,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 446 transitions. [2024-11-22 12:31:01,300 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 446 transitions. Word has length 108 [2024-11-22 12:31:01,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:31:01,306 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 446 transitions. [2024-11-22 12:31:01,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-22 12:31:01,307 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 446 transitions. [2024-11-22 12:31:01,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-22 12:31:01,307 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:31:01,308 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:31:01,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 12:31:01,308 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:31:01,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:31:01,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1532353785, now seen corresponding path program 1 times [2024-11-22 12:31:01,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:31:01,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733543812] [2024-11-22 12:31:01,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:31:01,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:31:01,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:31:01,729 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 18 proven. 15 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-22 12:31:01,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:31:01,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733543812] [2024-11-22 12:31:01,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733543812] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 12:31:01,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166095726] [2024-11-22 12:31:01,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:31:01,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 12:31:01,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 12:31:01,732 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 12:31:01,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-22 12:31:01,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:31:01,857 INFO L255 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-22 12:31:01,861 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:31:01,893 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-22 12:31:02,066 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 36 treesize of output 18 [2024-11-22 12:31:02,074 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-22 12:31:02,169 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 149 proven. 15 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-22 12:31:02,169 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:31:02,423 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 18 proven. 15 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-22 12:31:02,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166095726] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 12:31:02,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 12:31:02,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 26 [2024-11-22 12:31:02,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808059095] [2024-11-22 12:31:02,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 12:31:02,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-22 12:31:02,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:31:02,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-22 12:31:02,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=560, Unknown=0, NotChecked=0, Total=650 [2024-11-22 12:31:02,427 INFO L87 Difference]: Start difference. First operand 304 states and 446 transitions. Second operand has 26 states, 23 states have (on average 3.8260869565217392) internal successors, (88), 25 states have internal predecessors, (88), 6 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (24), 3 states have call predecessors, (24), 6 states have call successors, (24) [2024-11-22 12:31:03,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:31:03,321 INFO L93 Difference]: Finished difference Result 954 states and 1382 transitions. [2024-11-22 12:31:03,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-22 12:31:03,322 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 3.8260869565217392) internal successors, (88), 25 states have internal predecessors, (88), 6 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (24), 3 states have call predecessors, (24), 6 states have call successors, (24) Word has length 108 [2024-11-22 12:31:03,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:31:03,325 INFO L225 Difference]: With dead ends: 954 [2024-11-22 12:31:03,326 INFO L226 Difference]: Without dead ends: 653 [2024-11-22 12:31:03,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 537 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=432, Invalid=2118, Unknown=0, NotChecked=0, Total=2550 [2024-11-22 12:31:03,328 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 1056 mSDsluCounter, 1739 mSDsCounter, 0 mSdLazyCounter, 928 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1056 SdHoareTripleChecker+Valid, 1906 SdHoareTripleChecker+Invalid, 1043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 12:31:03,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1056 Valid, 1906 Invalid, 1043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 928 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-22 12:31:03,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2024-11-22 12:31:03,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 636. [2024-11-22 12:31:03,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 551 states have (on average 1.382940108892922) internal successors, (762), 551 states have internal predecessors, (762), 72 states have call successors, (72), 12 states have call predecessors, (72), 12 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-22 12:31:03,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 906 transitions. [2024-11-22 12:31:03,364 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 906 transitions. Word has length 108 [2024-11-22 12:31:03,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:31:03,365 INFO L471 AbstractCegarLoop]: Abstraction has 636 states and 906 transitions. [2024-11-22 12:31:03,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 3.8260869565217392) internal successors, (88), 25 states have internal predecessors, (88), 6 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (24), 3 states have call predecessors, (24), 6 states have call successors, (24) [2024-11-22 12:31:03,365 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 906 transitions. [2024-11-22 12:31:03,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-22 12:31:03,367 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:31:03,367 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:31:03,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-22 12:31:03,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-22 12:31:03,571 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:31:03,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:31:03,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1608308428, now seen corresponding path program 1 times [2024-11-22 12:31:03,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:31:03,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857534620] [2024-11-22 12:31:03,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:31:03,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:31:03,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:31:04,652 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-22 12:31:04,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:31:04,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857534620] [2024-11-22 12:31:04,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857534620] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:31:04,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:31:04,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-22 12:31:04,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474722077] [2024-11-22 12:31:04,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:31:04,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-22 12:31:04,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:31:04,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-22 12:31:04,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-22 12:31:04,655 INFO L87 Difference]: Start difference. First operand 636 states and 906 transitions. Second operand has 13 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-22 12:31:06,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:31:06,647 INFO L93 Difference]: Finished difference Result 2160 states and 3083 transitions. [2024-11-22 12:31:06,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-22 12:31:06,648 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 109 [2024-11-22 12:31:06,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:31:06,657 INFO L225 Difference]: With dead ends: 2160 [2024-11-22 12:31:06,657 INFO L226 Difference]: Without dead ends: 1949 [2024-11-22 12:31:06,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=203, Invalid=609, Unknown=0, NotChecked=0, Total=812 [2024-11-22 12:31:06,659 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 1552 mSDsluCounter, 973 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1552 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 1015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-22 12:31:06,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1552 Valid, 1084 Invalid, 1015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 775 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-22 12:31:06,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1949 states. [2024-11-22 12:31:06,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1949 to 1511. [2024-11-22 12:31:06,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1511 states, 1342 states have (on average 1.397913561847988) internal successors, (1876), 1350 states have internal predecessors, (1876), 144 states have call successors, (144), 24 states have call predecessors, (144), 24 states have return successors, (144), 136 states have call predecessors, (144), 144 states have call successors, (144) [2024-11-22 12:31:06,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1511 states to 1511 states and 2164 transitions. [2024-11-22 12:31:06,750 INFO L78 Accepts]: Start accepts. Automaton has 1511 states and 2164 transitions. Word has length 109 [2024-11-22 12:31:06,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:31:06,750 INFO L471 AbstractCegarLoop]: Abstraction has 1511 states and 2164 transitions. [2024-11-22 12:31:06,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-22 12:31:06,751 INFO L276 IsEmpty]: Start isEmpty. Operand 1511 states and 2164 transitions. [2024-11-22 12:31:06,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-22 12:31:06,754 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:31:06,754 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:31:06,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-22 12:31:06,754 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:31:06,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:31:06,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1486208967, now seen corresponding path program 1 times [2024-11-22 12:31:06,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:31:06,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719001063] [2024-11-22 12:31:06,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:31:06,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:31:06,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:31:06,982 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-22 12:31:06,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:31:06,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719001063] [2024-11-22 12:31:06,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719001063] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:31:06,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:31:06,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 12:31:06,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8977595] [2024-11-22 12:31:06,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:31:06,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 12:31:06,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:31:06,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 12:31:06,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-22 12:31:06,984 INFO L87 Difference]: Start difference. First operand 1511 states and 2164 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 12:31:07,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:31:07,258 INFO L93 Difference]: Finished difference Result 2806 states and 4006 transitions. [2024-11-22 12:31:07,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 12:31:07,259 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2024-11-22 12:31:07,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:31:07,267 INFO L225 Difference]: With dead ends: 2806 [2024-11-22 12:31:07,268 INFO L226 Difference]: Without dead ends: 1666 [2024-11-22 12:31:07,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-22 12:31:07,271 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 139 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 12:31:07,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 772 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 12:31:07,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1666 states. [2024-11-22 12:31:07,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1666 to 1658. [2024-11-22 12:31:07,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1658 states, 1459 states have (on average 1.3776559287183001) internal successors, (2010), 1467 states have internal predecessors, (2010), 168 states have call successors, (168), 30 states have call predecessors, (168), 30 states have return successors, (168), 160 states have call predecessors, (168), 168 states have call successors, (168) [2024-11-22 12:31:07,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1658 states and 2346 transitions. [2024-11-22 12:31:07,373 INFO L78 Accepts]: Start accepts. Automaton has 1658 states and 2346 transitions. Word has length 110 [2024-11-22 12:31:07,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:31:07,373 INFO L471 AbstractCegarLoop]: Abstraction has 1658 states and 2346 transitions. [2024-11-22 12:31:07,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 12:31:07,373 INFO L276 IsEmpty]: Start isEmpty. Operand 1658 states and 2346 transitions. [2024-11-22 12:31:07,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-22 12:31:07,375 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:31:07,375 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:31:07,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-22 12:31:07,375 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:31:07,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:31:07,376 INFO L85 PathProgramCache]: Analyzing trace with hash -757277625, now seen corresponding path program 1 times [2024-11-22 12:31:07,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:31:07,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513688759] [2024-11-22 12:31:07,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:31:07,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:31:07,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:31:07,503 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-22 12:31:07,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:31:07,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513688759] [2024-11-22 12:31:07,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513688759] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:31:07,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:31:07,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 12:31:07,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704330075] [2024-11-22 12:31:07,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:31:07,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 12:31:07,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:31:07,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 12:31:07,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 12:31:07,505 INFO L87 Difference]: Start difference. First operand 1658 states and 2346 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 12:31:07,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:31:07,778 INFO L93 Difference]: Finished difference Result 3094 states and 4365 transitions. [2024-11-22 12:31:07,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 12:31:07,779 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2024-11-22 12:31:07,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:31:07,785 INFO L225 Difference]: With dead ends: 3094 [2024-11-22 12:31:07,785 INFO L226 Difference]: Without dead ends: 1807 [2024-11-22 12:31:07,788 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-22 12:31:07,789 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 151 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 12:31:07,789 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 483 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 12:31:07,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1807 states. [2024-11-22 12:31:07,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1807 to 1799. [2024-11-22 12:31:07,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1799 states, 1573 states have (on average 1.371900826446281) internal successors, (2158), 1578 states have internal predecessors, (2158), 186 states have call successors, (186), 39 states have call predecessors, (186), 39 states have return successors, (186), 181 states have call predecessors, (186), 186 states have call successors, (186) [2024-11-22 12:31:07,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 2530 transitions. [2024-11-22 12:31:07,906 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 2530 transitions. Word has length 110 [2024-11-22 12:31:07,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:31:07,906 INFO L471 AbstractCegarLoop]: Abstraction has 1799 states and 2530 transitions. [2024-11-22 12:31:07,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 12:31:07,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 2530 transitions. [2024-11-22 12:31:07,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-22 12:31:07,909 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:31:07,909 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:31:07,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-22 12:31:07,909 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:31:07,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:31:07,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1221526159, now seen corresponding path program 1 times [2024-11-22 12:31:07,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:31:07,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130419939] [2024-11-22 12:31:07,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:31:07,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:31:07,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:31:08,312 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-22 12:31:08,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:31:08,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130419939] [2024-11-22 12:31:08,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130419939] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:31:08,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:31:08,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 12:31:08,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904801560] [2024-11-22 12:31:08,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:31:08,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 12:31:08,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:31:08,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 12:31:08,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-22 12:31:08,314 INFO L87 Difference]: Start difference. First operand 1799 states and 2530 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 12:31:08,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:31:08,641 INFO L93 Difference]: Finished difference Result 3050 states and 4272 transitions. [2024-11-22 12:31:08,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 12:31:08,642 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2024-11-22 12:31:08,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:31:08,648 INFO L225 Difference]: With dead ends: 3050 [2024-11-22 12:31:08,648 INFO L226 Difference]: Without dead ends: 1840 [2024-11-22 12:31:08,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-11-22 12:31:08,650 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 294 mSDsluCounter, 917 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 12:31:08,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 1087 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 12:31:08,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1840 states. [2024-11-22 12:31:08,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1840 to 1799. [2024-11-22 12:31:08,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1799 states, 1573 states have (on average 1.3693579148124602) internal successors, (2154), 1578 states have internal predecessors, (2154), 186 states have call successors, (186), 39 states have call predecessors, (186), 39 states have return successors, (186), 181 states have call predecessors, (186), 186 states have call successors, (186) [2024-11-22 12:31:08,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 2526 transitions. [2024-11-22 12:31:08,777 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 2526 transitions. Word has length 111 [2024-11-22 12:31:08,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:31:08,777 INFO L471 AbstractCegarLoop]: Abstraction has 1799 states and 2526 transitions. [2024-11-22 12:31:08,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 12:31:08,777 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 2526 transitions. [2024-11-22 12:31:08,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-22 12:31:08,778 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:31:08,779 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:31:08,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-22 12:31:08,779 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:31:08,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:31:08,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1122395994, now seen corresponding path program 1 times [2024-11-22 12:31:08,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:31:08,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59591507] [2024-11-22 12:31:08,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:31:08,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:31:08,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:31:08,866 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-22 12:31:08,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:31:08,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59591507] [2024-11-22 12:31:08,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59591507] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:31:08,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:31:08,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 12:31:08,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76725833] [2024-11-22 12:31:08,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:31:08,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 12:31:08,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:31:08,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 12:31:08,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 12:31:08,868 INFO L87 Difference]: Start difference. First operand 1799 states and 2526 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 12:31:08,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:31:08,983 INFO L93 Difference]: Finished difference Result 3579 states and 5020 transitions. [2024-11-22 12:31:08,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 12:31:08,983 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2024-11-22 12:31:08,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:31:08,989 INFO L225 Difference]: With dead ends: 3579 [2024-11-22 12:31:08,989 INFO L226 Difference]: Without dead ends: 1783 [2024-11-22 12:31:08,991 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-22 12:31:08,991 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 105 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:31:08,992 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 552 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:31:08,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1783 states. [2024-11-22 12:31:09,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1783 to 1209. [2024-11-22 12:31:09,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1209 states, 1055 states have (on average 1.3582938388625592) internal successors, (1433), 1058 states have internal predecessors, (1433), 126 states have call successors, (126), 27 states have call predecessors, (126), 27 states have return successors, (126), 123 states have call predecessors, (126), 126 states have call successors, (126) [2024-11-22 12:31:09,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1209 states to 1209 states and 1685 transitions. [2024-11-22 12:31:09,080 INFO L78 Accepts]: Start accepts. Automaton has 1209 states and 1685 transitions. Word has length 111 [2024-11-22 12:31:09,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:31:09,080 INFO L471 AbstractCegarLoop]: Abstraction has 1209 states and 1685 transitions. [2024-11-22 12:31:09,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 12:31:09,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1209 states and 1685 transitions. [2024-11-22 12:31:09,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-22 12:31:09,081 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:31:09,081 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:31:09,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-22 12:31:09,082 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:31:09,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:31:09,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1897731394, now seen corresponding path program 1 times [2024-11-22 12:31:09,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:31:09,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323580476] [2024-11-22 12:31:09,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:31:09,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:31:09,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:31:09,234 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-22 12:31:09,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:31:09,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323580476] [2024-11-22 12:31:09,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323580476] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 12:31:09,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924854358] [2024-11-22 12:31:09,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:31:09,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 12:31:09,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 12:31:09,238 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 12:31:09,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-22 12:31:09,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:31:09,375 INFO L255 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 12:31:09,377 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:31:09,407 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-22 12:31:09,407 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:31:09,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1924854358] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:31:09,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 12:31:09,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2024-11-22 12:31:09,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281702547] [2024-11-22 12:31:09,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:31:09,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 12:31:09,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:31:09,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 12:31:09,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-22 12:31:09,410 INFO L87 Difference]: Start difference. First operand 1209 states and 1685 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 12:31:09,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:31:09,536 INFO L93 Difference]: Finished difference Result 2451 states and 3415 transitions. [2024-11-22 12:31:09,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 12:31:09,537 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2024-11-22 12:31:09,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:31:09,541 INFO L225 Difference]: With dead ends: 2451 [2024-11-22 12:31:09,541 INFO L226 Difference]: Without dead ends: 1245 [2024-11-22 12:31:09,543 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-22 12:31:09,543 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:31:09,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 573 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:31:09,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1245 states. [2024-11-22 12:31:09,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1245 to 1245. [2024-11-22 12:31:09,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1245 states, 1091 states have (on average 1.3464711274060495) internal successors, (1469), 1094 states have internal predecessors, (1469), 126 states have call successors, (126), 27 states have call predecessors, (126), 27 states have return successors, (126), 123 states have call predecessors, (126), 126 states have call successors, (126) [2024-11-22 12:31:09,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1245 states to 1245 states and 1721 transitions. [2024-11-22 12:31:09,618 INFO L78 Accepts]: Start accepts. Automaton has 1245 states and 1721 transitions. Word has length 111 [2024-11-22 12:31:09,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:31:09,618 INFO L471 AbstractCegarLoop]: Abstraction has 1245 states and 1721 transitions. [2024-11-22 12:31:09,619 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 12:31:09,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1245 states and 1721 transitions. [2024-11-22 12:31:09,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-22 12:31:09,620 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:31:09,620 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:31:09,628 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-22 12:31:09,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 12:31:09,821 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:31:09,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:31:09,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1291983155, now seen corresponding path program 1 times [2024-11-22 12:31:09,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:31:09,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361204701] [2024-11-22 12:31:09,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:31:09,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:31:09,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:31:10,899 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-22 12:31:10,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:31:10,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361204701] [2024-11-22 12:31:10,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361204701] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:31:10,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:31:10,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-22 12:31:10,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588849352] [2024-11-22 12:31:10,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:31:10,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-22 12:31:10,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:31:10,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-22 12:31:10,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-11-22 12:31:10,901 INFO L87 Difference]: Start difference. First operand 1245 states and 1721 transitions. Second operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 12:31:13,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:31:13,111 INFO L93 Difference]: Finished difference Result 3196 states and 4420 transitions. [2024-11-22 12:31:13,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-22 12:31:13,111 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2024-11-22 12:31:13,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:31:13,117 INFO L225 Difference]: With dead ends: 3196 [2024-11-22 12:31:13,117 INFO L226 Difference]: Without dead ends: 2141 [2024-11-22 12:31:13,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=136, Invalid=734, Unknown=0, NotChecked=0, Total=870 [2024-11-22 12:31:13,119 INFO L432 NwaCegarLoop]: 297 mSDtfsCounter, 554 mSDsluCounter, 2363 mSDsCounter, 0 mSdLazyCounter, 1753 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 2660 SdHoareTripleChecker+Invalid, 1784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-22 12:31:13,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [554 Valid, 2660 Invalid, 1784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1753 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-22 12:31:13,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2141 states. [2024-11-22 12:31:13,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2141 to 1242. [2024-11-22 12:31:13,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1242 states, 1088 states have (on average 1.3465073529411764) internal successors, (1465), 1091 states have internal predecessors, (1465), 126 states have call successors, (126), 27 states have call predecessors, (126), 27 states have return successors, (126), 123 states have call predecessors, (126), 126 states have call successors, (126) [2024-11-22 12:31:13,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1242 states to 1242 states and 1717 transitions. [2024-11-22 12:31:13,201 INFO L78 Accepts]: Start accepts. Automaton has 1242 states and 1717 transitions. Word has length 111 [2024-11-22 12:31:13,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:31:13,201 INFO L471 AbstractCegarLoop]: Abstraction has 1242 states and 1717 transitions. [2024-11-22 12:31:13,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 12:31:13,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1242 states and 1717 transitions. [2024-11-22 12:31:13,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-22 12:31:13,202 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:31:13,203 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:31:13,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-22 12:31:13,203 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:31:13,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:31:13,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1354874193, now seen corresponding path program 1 times [2024-11-22 12:31:13,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:31:13,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424736150] [2024-11-22 12:31:13,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:31:13,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:31:13,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:31:13,456 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-22 12:31:13,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:31:13,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424736150] [2024-11-22 12:31:13,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424736150] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:31:13,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:31:13,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 12:31:13,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660447204] [2024-11-22 12:31:13,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:31:13,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 12:31:13,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:31:13,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 12:31:13,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-22 12:31:13,457 INFO L87 Difference]: Start difference. First operand 1242 states and 1717 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 12:31:13,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:31:13,717 INFO L93 Difference]: Finished difference Result 2119 states and 2933 transitions. [2024-11-22 12:31:13,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 12:31:13,717 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2024-11-22 12:31:13,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:31:13,721 INFO L225 Difference]: With dead ends: 2119 [2024-11-22 12:31:13,721 INFO L226 Difference]: Without dead ends: 1026 [2024-11-22 12:31:13,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-22 12:31:13,724 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 257 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 12:31:13,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 684 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 12:31:13,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2024-11-22 12:31:13,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 703. [2024-11-22 12:31:13,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 703 states, 615 states have (on average 1.3414634146341464) internal successors, (825), 617 states have internal predecessors, (825), 72 states have call successors, (72), 15 states have call predecessors, (72), 15 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-22 12:31:13,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 969 transitions. [2024-11-22 12:31:13,799 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 969 transitions. Word has length 111 [2024-11-22 12:31:13,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:31:13,799 INFO L471 AbstractCegarLoop]: Abstraction has 703 states and 969 transitions. [2024-11-22 12:31:13,799 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 12:31:13,799 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 969 transitions. [2024-11-22 12:31:13,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-22 12:31:13,800 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:31:13,800 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:31:13,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-22 12:31:13,800 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:31:13,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:31:13,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1867335442, now seen corresponding path program 1 times [2024-11-22 12:31:13,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:31:13,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424117203] [2024-11-22 12:31:13,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:31:13,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:31:13,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:31:13,895 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-22 12:31:13,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:31:13,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424117203] [2024-11-22 12:31:13,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424117203] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:31:13,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:31:13,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 12:31:13,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685552503] [2024-11-22 12:31:13,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:31:13,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 12:31:13,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:31:13,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 12:31:13,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 12:31:13,897 INFO L87 Difference]: Start difference. First operand 703 states and 969 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 12:31:14,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:31:14,034 INFO L93 Difference]: Finished difference Result 2019 states and 2792 transitions. [2024-11-22 12:31:14,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 12:31:14,035 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2024-11-22 12:31:14,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:31:14,039 INFO L225 Difference]: With dead ends: 2019 [2024-11-22 12:31:14,039 INFO L226 Difference]: Without dead ends: 1319 [2024-11-22 12:31:14,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-22 12:31:14,040 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 102 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:31:14,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 730 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:31:14,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2024-11-22 12:31:14,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1312. [2024-11-22 12:31:14,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1312 states, 1152 states have (on average 1.3411458333333333) internal successors, (1545), 1156 states have internal predecessors, (1545), 132 states have call successors, (132), 27 states have call predecessors, (132), 27 states have return successors, (132), 128 states have call predecessors, (132), 132 states have call successors, (132) [2024-11-22 12:31:14,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1312 states and 1809 transitions. [2024-11-22 12:31:14,135 INFO L78 Accepts]: Start accepts. Automaton has 1312 states and 1809 transitions. Word has length 111 [2024-11-22 12:31:14,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:31:14,136 INFO L471 AbstractCegarLoop]: Abstraction has 1312 states and 1809 transitions. [2024-11-22 12:31:14,136 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 12:31:14,136 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 1809 transitions. [2024-11-22 12:31:14,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-22 12:31:14,137 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:31:14,137 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:31:14,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-22 12:31:14,137 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:31:14,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:31:14,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1565691096, now seen corresponding path program 1 times [2024-11-22 12:31:14,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:31:14,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606107534] [2024-11-22 12:31:14,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:31:14,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:31:14,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:31:14,565 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-22 12:31:14,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:31:14,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606107534] [2024-11-22 12:31:14,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606107534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:31:14,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:31:14,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 12:31:14,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596890427] [2024-11-22 12:31:14,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:31:14,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 12:31:14,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:31:14,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 12:31:14,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-22 12:31:14,567 INFO L87 Difference]: Start difference. First operand 1312 states and 1809 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 12:31:14,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:31:14,935 INFO L93 Difference]: Finished difference Result 2625 states and 3618 transitions. [2024-11-22 12:31:14,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 12:31:14,935 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 112 [2024-11-22 12:31:14,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:31:14,939 INFO L225 Difference]: With dead ends: 2625 [2024-11-22 12:31:14,940 INFO L226 Difference]: Without dead ends: 1316 [2024-11-22 12:31:14,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-22 12:31:14,942 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 201 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 12:31:14,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 710 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 12:31:14,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1316 states. [2024-11-22 12:31:15,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1316 to 1306. [2024-11-22 12:31:15,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1306 states, 1146 states have (on average 1.3359511343804538) internal successors, (1531), 1150 states have internal predecessors, (1531), 132 states have call successors, (132), 27 states have call predecessors, (132), 27 states have return successors, (132), 128 states have call predecessors, (132), 132 states have call successors, (132) [2024-11-22 12:31:15,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1306 states to 1306 states and 1795 transitions. [2024-11-22 12:31:15,041 INFO L78 Accepts]: Start accepts. Automaton has 1306 states and 1795 transitions. Word has length 112 [2024-11-22 12:31:15,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:31:15,041 INFO L471 AbstractCegarLoop]: Abstraction has 1306 states and 1795 transitions. [2024-11-22 12:31:15,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 12:31:15,041 INFO L276 IsEmpty]: Start isEmpty. Operand 1306 states and 1795 transitions. [2024-11-22 12:31:15,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-22 12:31:15,042 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:31:15,043 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:31:15,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-22 12:31:15,043 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:31:15,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:31:15,043 INFO L85 PathProgramCache]: Analyzing trace with hash 978885082, now seen corresponding path program 1 times [2024-11-22 12:31:15,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:31:15,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122586424] [2024-11-22 12:31:15,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:31:15,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:31:15,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:31:15,358 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-22 12:31:15,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:31:15,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122586424] [2024-11-22 12:31:15,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122586424] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:31:15,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:31:15,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 12:31:15,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840081767] [2024-11-22 12:31:15,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:31:15,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 12:31:15,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:31:15,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 12:31:15,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-22 12:31:15,360 INFO L87 Difference]: Start difference. First operand 1306 states and 1795 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 12:31:15,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:31:15,887 INFO L93 Difference]: Finished difference Result 3123 states and 4310 transitions. [2024-11-22 12:31:15,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-22 12:31:15,888 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 112 [2024-11-22 12:31:15,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:31:15,898 INFO L225 Difference]: With dead ends: 3123 [2024-11-22 12:31:15,898 INFO L226 Difference]: Without dead ends: 2423 [2024-11-22 12:31:15,900 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2024-11-22 12:31:15,902 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 445 mSDsluCounter, 1403 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 1664 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 12:31:15,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 1664 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 12:31:15,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2423 states. [2024-11-22 12:31:16,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2423 to 1930. [2024-11-22 12:31:16,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1930 states, 1698 states have (on average 1.3433451118963486) internal successors, (2281), 1704 states have internal predecessors, (2281), 192 states have call successors, (192), 39 states have call predecessors, (192), 39 states have return successors, (192), 186 states have call predecessors, (192), 192 states have call successors, (192) [2024-11-22 12:31:16,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1930 states to 1930 states and 2665 transitions. [2024-11-22 12:31:16,045 INFO L78 Accepts]: Start accepts. Automaton has 1930 states and 2665 transitions. Word has length 112 [2024-11-22 12:31:16,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:31:16,046 INFO L471 AbstractCegarLoop]: Abstraction has 1930 states and 2665 transitions. [2024-11-22 12:31:16,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 12:31:16,046 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 2665 transitions. [2024-11-22 12:31:16,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-22 12:31:16,047 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:31:16,047 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:31:16,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-22 12:31:16,048 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:31:16,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:31:16,048 INFO L85 PathProgramCache]: Analyzing trace with hash -2075285022, now seen corresponding path program 1 times [2024-11-22 12:31:16,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:31:16,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862189834] [2024-11-22 12:31:16,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:31:16,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:31:16,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:31:16,421 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-22 12:31:16,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:31:16,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862189834] [2024-11-22 12:31:16,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862189834] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:31:16,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:31:16,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 12:31:16,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599024806] [2024-11-22 12:31:16,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:31:16,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 12:31:16,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:31:16,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 12:31:16,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-22 12:31:16,424 INFO L87 Difference]: Start difference. First operand 1930 states and 2665 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 12:31:17,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:31:17,022 INFO L93 Difference]: Finished difference Result 3358 states and 4629 transitions. [2024-11-22 12:31:17,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 12:31:17,023 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 112 [2024-11-22 12:31:17,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:31:17,031 INFO L225 Difference]: With dead ends: 3358 [2024-11-22 12:31:17,031 INFO L226 Difference]: Without dead ends: 2416 [2024-11-22 12:31:17,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-11-22 12:31:17,034 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 312 mSDsluCounter, 1042 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 1260 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 12:31:17,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 1260 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 12:31:17,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2416 states. [2024-11-22 12:31:17,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2416 to 1927. [2024-11-22 12:31:17,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1927 states, 1695 states have (on average 1.336283185840708) internal successors, (2265), 1701 states have internal predecessors, (2265), 192 states have call successors, (192), 39 states have call predecessors, (192), 39 states have return successors, (192), 186 states have call predecessors, (192), 192 states have call successors, (192) [2024-11-22 12:31:17,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1927 states to 1927 states and 2649 transitions. [2024-11-22 12:31:17,221 INFO L78 Accepts]: Start accepts. Automaton has 1927 states and 2649 transitions. Word has length 112 [2024-11-22 12:31:17,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:31:17,221 INFO L471 AbstractCegarLoop]: Abstraction has 1927 states and 2649 transitions. [2024-11-22 12:31:17,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 12:31:17,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1927 states and 2649 transitions. [2024-11-22 12:31:17,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-22 12:31:17,223 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:31:17,223 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:31:17,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-22 12:31:17,223 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:31:17,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:31:17,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1240867778, now seen corresponding path program 1 times [2024-11-22 12:31:17,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:31:17,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845579392] [2024-11-22 12:31:17,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:31:17,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:31:17,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:31:17,426 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-22 12:31:17,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:31:17,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845579392] [2024-11-22 12:31:17,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845579392] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:31:17,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:31:17,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 12:31:17,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771156302] [2024-11-22 12:31:17,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:31:17,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 12:31:17,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:31:17,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 12:31:17,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 12:31:17,428 INFO L87 Difference]: Start difference. First operand 1927 states and 2649 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 12:31:17,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:31:17,708 INFO L93 Difference]: Finished difference Result 3259 states and 4485 transitions. [2024-11-22 12:31:17,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 12:31:17,709 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2024-11-22 12:31:17,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:31:17,715 INFO L225 Difference]: With dead ends: 3259 [2024-11-22 12:31:17,716 INFO L226 Difference]: Without dead ends: 1946 [2024-11-22 12:31:17,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-22 12:31:17,718 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 92 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 12:31:17,718 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 628 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 12:31:17,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1946 states. [2024-11-22 12:31:17,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1946 to 1935. [2024-11-22 12:31:17,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1935 states, 1703 states have (on average 1.3347034644744569) internal successors, (2273), 1709 states have internal predecessors, (2273), 192 states have call successors, (192), 39 states have call predecessors, (192), 39 states have return successors, (192), 186 states have call predecessors, (192), 192 states have call successors, (192) [2024-11-22 12:31:17,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 2657 transitions. [2024-11-22 12:31:17,948 INFO L78 Accepts]: Start accepts. Automaton has 1935 states and 2657 transitions. Word has length 113 [2024-11-22 12:31:17,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:31:17,948 INFO L471 AbstractCegarLoop]: Abstraction has 1935 states and 2657 transitions. [2024-11-22 12:31:17,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 12:31:17,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 2657 transitions. [2024-11-22 12:31:17,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-22 12:31:17,950 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:31:17,950 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:31:17,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-22 12:31:17,950 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:31:17,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:31:17,951 INFO L85 PathProgramCache]: Analyzing trace with hash -453386666, now seen corresponding path program 1 times [2024-11-22 12:31:17,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:31:17,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690432457] [2024-11-22 12:31:17,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:31:17,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:31:17,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:31:18,472 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-22 12:31:18,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:31:18,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690432457] [2024-11-22 12:31:18,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690432457] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:31:18,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:31:18,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-22 12:31:18,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093182727] [2024-11-22 12:31:18,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:31:18,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 12:31:18,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:31:18,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 12:31:18,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-22 12:31:18,474 INFO L87 Difference]: Start difference. First operand 1935 states and 2657 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-22 12:31:19,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:31:19,144 INFO L93 Difference]: Finished difference Result 4122 states and 5666 transitions. [2024-11-22 12:31:19,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 12:31:19,144 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 113 [2024-11-22 12:31:19,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:31:19,153 INFO L225 Difference]: With dead ends: 4122 [2024-11-22 12:31:19,153 INFO L226 Difference]: Without dead ends: 2801 [2024-11-22 12:31:19,160 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2024-11-22 12:31:19,161 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 447 mSDsluCounter, 966 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 1151 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 12:31:19,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 1151 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 12:31:19,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2801 states. [2024-11-22 12:31:19,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2801 to 1740. [2024-11-22 12:31:19,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1740 states, 1529 states have (on average 1.3335513407455855) internal successors, (2039), 1534 states have internal predecessors, (2039), 174 states have call successors, (174), 36 states have call predecessors, (174), 36 states have return successors, (174), 169 states have call predecessors, (174), 174 states have call successors, (174) [2024-11-22 12:31:19,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1740 states to 1740 states and 2387 transitions. [2024-11-22 12:31:19,297 INFO L78 Accepts]: Start accepts. Automaton has 1740 states and 2387 transitions. Word has length 113 [2024-11-22 12:31:19,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:31:19,298 INFO L471 AbstractCegarLoop]: Abstraction has 1740 states and 2387 transitions. [2024-11-22 12:31:19,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-22 12:31:19,298 INFO L276 IsEmpty]: Start isEmpty. Operand 1740 states and 2387 transitions. [2024-11-22 12:31:19,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-22 12:31:19,299 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:31:19,299 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:31:19,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-22 12:31:19,300 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:31:19,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:31:19,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1373369687, now seen corresponding path program 1 times [2024-11-22 12:31:19,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:31:19,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458381858] [2024-11-22 12:31:19,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:31:19,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:31:19,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:31:19,399 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-22 12:31:19,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:31:19,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458381858] [2024-11-22 12:31:19,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458381858] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 12:31:19,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304653371] [2024-11-22 12:31:19,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:31:19,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 12:31:19,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 12:31:19,401 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 12:31:19,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-22 12:31:19,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:31:19,554 INFO L255 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 12:31:19,557 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:31:19,568 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-22 12:31:19,568 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:31:19,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304653371] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:31:19,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 12:31:19,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2024-11-22 12:31:19,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335657291] [2024-11-22 12:31:19,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:31:19,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 12:31:19,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:31:19,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 12:31:19,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-22 12:31:19,570 INFO L87 Difference]: Start difference. First operand 1740 states and 2387 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 12:31:19,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:31:19,695 INFO L93 Difference]: Finished difference Result 3528 states and 4839 transitions. [2024-11-22 12:31:19,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 12:31:19,695 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2024-11-22 12:31:19,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:31:19,701 INFO L225 Difference]: With dead ends: 3528 [2024-11-22 12:31:19,701 INFO L226 Difference]: Without dead ends: 1791 [2024-11-22 12:31:19,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-22 12:31:19,705 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:31:19,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 572 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:31:19,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1791 states. [2024-11-22 12:31:19,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1791 to 1791. [2024-11-22 12:31:19,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1791 states, 1580 states have (on average 1.3227848101265822) internal successors, (2090), 1585 states have internal predecessors, (2090), 174 states have call successors, (174), 36 states have call predecessors, (174), 36 states have return successors, (174), 169 states have call predecessors, (174), 174 states have call successors, (174) [2024-11-22 12:31:19,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1791 states to 1791 states and 2438 transitions. [2024-11-22 12:31:19,842 INFO L78 Accepts]: Start accepts. Automaton has 1791 states and 2438 transitions. Word has length 113 [2024-11-22 12:31:19,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:31:19,843 INFO L471 AbstractCegarLoop]: Abstraction has 1791 states and 2438 transitions. [2024-11-22 12:31:19,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 12:31:19,843 INFO L276 IsEmpty]: Start isEmpty. Operand 1791 states and 2438 transitions. [2024-11-22 12:31:19,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-22 12:31:19,844 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:31:19,844 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:31:19,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-22 12:31:20,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 12:31:20,048 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:31:20,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:31:20,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1912099421, now seen corresponding path program 1 times [2024-11-22 12:31:20,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:31:20,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143961892] [2024-11-22 12:31:20,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:31:20,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:31:20,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:31:21,110 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-22 12:31:21,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:31:21,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143961892] [2024-11-22 12:31:21,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143961892] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:31:21,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:31:21,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-22 12:31:21,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039611720] [2024-11-22 12:31:21,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:31:21,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-22 12:31:21,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:31:21,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-22 12:31:21,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-22 12:31:21,113 INFO L87 Difference]: Start difference. First operand 1791 states and 2438 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 12:31:23,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:31:23,421 INFO L93 Difference]: Finished difference Result 3298 states and 4482 transitions. [2024-11-22 12:31:23,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-22 12:31:23,421 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2024-11-22 12:31:23,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:31:23,427 INFO L225 Difference]: With dead ends: 3298 [2024-11-22 12:31:23,427 INFO L226 Difference]: Without dead ends: 2340 [2024-11-22 12:31:23,429 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2024-11-22 12:31:23,429 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 588 mSDsluCounter, 1312 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 1538 SdHoareTripleChecker+Invalid, 998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-22 12:31:23,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 1538 Invalid, 998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-22 12:31:23,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2340 states. [2024-11-22 12:31:23,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2340 to 1805. [2024-11-22 12:31:23,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1805 states, 1594 states have (on average 1.3212045169385194) internal successors, (2106), 1599 states have internal predecessors, (2106), 174 states have call successors, (174), 36 states have call predecessors, (174), 36 states have return successors, (174), 169 states have call predecessors, (174), 174 states have call successors, (174) [2024-11-22 12:31:23,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1805 states to 1805 states and 2454 transitions. [2024-11-22 12:31:23,616 INFO L78 Accepts]: Start accepts. Automaton has 1805 states and 2454 transitions. Word has length 113 [2024-11-22 12:31:23,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:31:23,617 INFO L471 AbstractCegarLoop]: Abstraction has 1805 states and 2454 transitions. [2024-11-22 12:31:23,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 12:31:23,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1805 states and 2454 transitions. [2024-11-22 12:31:23,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-22 12:31:23,618 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:31:23,618 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:31:23,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-22 12:31:23,619 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:31:23,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:31:23,619 INFO L85 PathProgramCache]: Analyzing trace with hash 868970119, now seen corresponding path program 1 times [2024-11-22 12:31:23,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:31:23,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258689016] [2024-11-22 12:31:23,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:31:23,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:31:23,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:31:23,815 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-22 12:31:23,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:31:23,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258689016] [2024-11-22 12:31:23,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258689016] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:31:23,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:31:23,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 12:31:23,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933204050] [2024-11-22 12:31:23,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:31:23,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 12:31:23,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:31:23,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 12:31:23,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 12:31:23,818 INFO L87 Difference]: Start difference. First operand 1805 states and 2454 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 12:31:24,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:31:24,099 INFO L93 Difference]: Finished difference Result 3234 states and 4399 transitions. [2024-11-22 12:31:24,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 12:31:24,100 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2024-11-22 12:31:24,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:31:24,104 INFO L225 Difference]: With dead ends: 3234 [2024-11-22 12:31:24,104 INFO L226 Difference]: Without dead ends: 1830 [2024-11-22 12:31:24,106 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-22 12:31:24,107 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 132 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 12:31:24,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 563 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 12:31:24,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1830 states. [2024-11-22 12:31:24,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1830 to 1805. [2024-11-22 12:31:24,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1805 states, 1594 states have (on average 1.3186951066499373) internal successors, (2102), 1599 states have internal predecessors, (2102), 174 states have call successors, (174), 36 states have call predecessors, (174), 36 states have return successors, (174), 169 states have call predecessors, (174), 174 states have call successors, (174) [2024-11-22 12:31:24,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1805 states to 1805 states and 2450 transitions. [2024-11-22 12:31:24,251 INFO L78 Accepts]: Start accepts. Automaton has 1805 states and 2450 transitions. Word has length 113 [2024-11-22 12:31:24,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:31:24,252 INFO L471 AbstractCegarLoop]: Abstraction has 1805 states and 2450 transitions. [2024-11-22 12:31:24,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 12:31:24,253 INFO L276 IsEmpty]: Start isEmpty. Operand 1805 states and 2450 transitions. [2024-11-22 12:31:24,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-22 12:31:24,254 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:31:24,254 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:31:24,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-22 12:31:24,255 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:31:24,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:31:24,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1865350813, now seen corresponding path program 1 times [2024-11-22 12:31:24,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:31:24,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881898729] [2024-11-22 12:31:24,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:31:24,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:31:24,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:31:24,818 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-22 12:31:24,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:31:24,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881898729] [2024-11-22 12:31:24,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881898729] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:31:24,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:31:24,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 12:31:24,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844478963] [2024-11-22 12:31:24,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:31:24,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 12:31:24,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:31:24,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 12:31:24,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-22 12:31:24,819 INFO L87 Difference]: Start difference. First operand 1805 states and 2450 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 12:31:25,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:31:25,359 INFO L93 Difference]: Finished difference Result 3159 states and 4283 transitions. [2024-11-22 12:31:25,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 12:31:25,359 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2024-11-22 12:31:25,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:31:25,363 INFO L225 Difference]: With dead ends: 3159 [2024-11-22 12:31:25,363 INFO L226 Difference]: Without dead ends: 1981 [2024-11-22 12:31:25,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-22 12:31:25,365 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 226 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 1248 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 12:31:25,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 1248 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 12:31:25,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1981 states. [2024-11-22 12:31:25,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1981 to 1797. [2024-11-22 12:31:25,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1797 states, 1586 states have (on average 1.3165195460277428) internal successors, (2088), 1591 states have internal predecessors, (2088), 174 states have call successors, (174), 36 states have call predecessors, (174), 36 states have return successors, (174), 169 states have call predecessors, (174), 174 states have call successors, (174) [2024-11-22 12:31:25,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2436 transitions. [2024-11-22 12:31:25,494 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2436 transitions. Word has length 114 [2024-11-22 12:31:25,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:31:25,495 INFO L471 AbstractCegarLoop]: Abstraction has 1797 states and 2436 transitions. [2024-11-22 12:31:25,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 12:31:25,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2436 transitions. [2024-11-22 12:31:25,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-22 12:31:25,496 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:31:25,496 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:31:25,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-22 12:31:25,496 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:31:25,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:31:25,496 INFO L85 PathProgramCache]: Analyzing trace with hash 837225436, now seen corresponding path program 1 times [2024-11-22 12:31:25,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:31:25,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42748651] [2024-11-22 12:31:25,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:31:25,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:31:25,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:31:25,573 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-22 12:31:25,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:31:25,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42748651] [2024-11-22 12:31:25,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42748651] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:31:25,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:31:25,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 12:31:25,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136503311] [2024-11-22 12:31:25,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:31:25,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 12:31:25,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:31:25,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 12:31:25,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 12:31:25,575 INFO L87 Difference]: Start difference. First operand 1797 states and 2436 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 12:31:25,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:31:25,745 INFO L93 Difference]: Finished difference Result 3194 states and 4329 transitions. [2024-11-22 12:31:25,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 12:31:25,746 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2024-11-22 12:31:25,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:31:25,749 INFO L225 Difference]: With dead ends: 3194 [2024-11-22 12:31:25,750 INFO L226 Difference]: Without dead ends: 1790 [2024-11-22 12:31:25,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-22 12:31:25,752 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 93 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:31:25,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 519 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:31:25,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2024-11-22 12:31:25,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1788. [2024-11-22 12:31:25,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1788 states, 1577 states have (on average 1.3138871274571973) internal successors, (2072), 1582 states have internal predecessors, (2072), 174 states have call successors, (174), 36 states have call predecessors, (174), 36 states have return successors, (174), 169 states have call predecessors, (174), 174 states have call successors, (174) [2024-11-22 12:31:25,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1788 states to 1788 states and 2420 transitions. [2024-11-22 12:31:25,881 INFO L78 Accepts]: Start accepts. Automaton has 1788 states and 2420 transitions. Word has length 114 [2024-11-22 12:31:25,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:31:25,882 INFO L471 AbstractCegarLoop]: Abstraction has 1788 states and 2420 transitions. [2024-11-22 12:31:25,882 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 12:31:25,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1788 states and 2420 transitions. [2024-11-22 12:31:25,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-22 12:31:25,883 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:31:25,883 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:31:25,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-22 12:31:25,883 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:31:25,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:31:25,884 INFO L85 PathProgramCache]: Analyzing trace with hash -353264335, now seen corresponding path program 1 times [2024-11-22 12:31:25,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:31:25,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037139638] [2024-11-22 12:31:25,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:31:25,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:31:25,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:31:26,053 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-22 12:31:26,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:31:26,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037139638] [2024-11-22 12:31:26,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037139638] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:31:26,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:31:26,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 12:31:26,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574137963] [2024-11-22 12:31:26,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:31:26,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 12:31:26,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:31:26,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 12:31:26,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-22 12:31:26,054 INFO L87 Difference]: Start difference. First operand 1788 states and 2420 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 12:31:26,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:31:26,329 INFO L93 Difference]: Finished difference Result 2779 states and 3767 transitions. [2024-11-22 12:31:26,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 12:31:26,330 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2024-11-22 12:31:26,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:31:26,334 INFO L225 Difference]: With dead ends: 2779 [2024-11-22 12:31:26,334 INFO L226 Difference]: Without dead ends: 1807 [2024-11-22 12:31:26,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-22 12:31:26,335 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 130 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 12:31:26,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 694 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 12:31:26,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1807 states. [2024-11-22 12:31:26,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1807 to 1796. [2024-11-22 12:31:26,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1796 states, 1585 states have (on average 1.3123028391167193) internal successors, (2080), 1590 states have internal predecessors, (2080), 174 states have call successors, (174), 36 states have call predecessors, (174), 36 states have return successors, (174), 169 states have call predecessors, (174), 174 states have call successors, (174) [2024-11-22 12:31:26,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1796 states to 1796 states and 2428 transitions. [2024-11-22 12:31:26,464 INFO L78 Accepts]: Start accepts. Automaton has 1796 states and 2428 transitions. Word has length 114 [2024-11-22 12:31:26,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:31:26,465 INFO L471 AbstractCegarLoop]: Abstraction has 1796 states and 2428 transitions. [2024-11-22 12:31:26,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 12:31:26,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1796 states and 2428 transitions. [2024-11-22 12:31:26,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-22 12:31:26,466 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:31:26,466 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:31:26,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-22 12:31:26,466 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:31:26,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:31:26,466 INFO L85 PathProgramCache]: Analyzing trace with hash -576900473, now seen corresponding path program 1 times [2024-11-22 12:31:26,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:31:26,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13033638] [2024-11-22 12:31:26,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:31:26,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:31:26,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:31:26,858 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-22 12:31:26,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:31:26,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13033638] [2024-11-22 12:31:26,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13033638] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:31:26,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:31:26,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-22 12:31:26,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38186961] [2024-11-22 12:31:26,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:31:26,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 12:31:26,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:31:26,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 12:31:26,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-22 12:31:26,860 INFO L87 Difference]: Start difference. First operand 1796 states and 2428 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-22 12:31:27,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:31:27,379 INFO L93 Difference]: Finished difference Result 2939 states and 3973 transitions. [2024-11-22 12:31:27,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 12:31:27,380 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 114 [2024-11-22 12:31:27,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:31:27,384 INFO L225 Difference]: With dead ends: 2939 [2024-11-22 12:31:27,384 INFO L226 Difference]: Without dead ends: 1959 [2024-11-22 12:31:27,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2024-11-22 12:31:27,386 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 484 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 12:31:27,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 731 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 12:31:27,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1959 states. [2024-11-22 12:31:27,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1959 to 1365. [2024-11-22 12:31:27,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1365 states, 1205 states have (on average 1.307883817427386) internal successors, (1576), 1209 states have internal predecessors, (1576), 132 states have call successors, (132), 27 states have call predecessors, (132), 27 states have return successors, (132), 128 states have call predecessors, (132), 132 states have call successors, (132) [2024-11-22 12:31:27,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 1840 transitions. [2024-11-22 12:31:27,490 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 1840 transitions. Word has length 114 [2024-11-22 12:31:27,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:31:27,491 INFO L471 AbstractCegarLoop]: Abstraction has 1365 states and 1840 transitions. [2024-11-22 12:31:27,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-22 12:31:27,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 1840 transitions. [2024-11-22 12:31:27,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-22 12:31:27,492 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:31:27,492 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:31:27,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-22 12:31:27,492 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:31:27,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:31:27,492 INFO L85 PathProgramCache]: Analyzing trace with hash 327205040, now seen corresponding path program 1 times [2024-11-22 12:31:27,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:31:27,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198452626] [2024-11-22 12:31:27,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:31:27,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:31:27,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:31:27,559 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-22 12:31:27,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:31:27,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198452626] [2024-11-22 12:31:27,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198452626] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:31:27,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:31:27,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 12:31:27,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641101907] [2024-11-22 12:31:27,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:31:27,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 12:31:27,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:31:27,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 12:31:27,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 12:31:27,561 INFO L87 Difference]: Start difference. First operand 1365 states and 1840 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 12:31:27,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:31:27,629 INFO L93 Difference]: Finished difference Result 2266 states and 3059 transitions. [2024-11-22 12:31:27,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 12:31:27,630 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-11-22 12:31:27,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:31:27,632 INFO L225 Difference]: With dead ends: 2266 [2024-11-22 12:31:27,632 INFO L226 Difference]: Without dead ends: 896 [2024-11-22 12:31:27,634 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 12:31:27,634 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:31:27,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 290 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:31:27,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2024-11-22 12:31:27,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 892. [2024-11-22 12:31:27,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 892 states, 792 states have (on average 1.3068181818181819) internal successors, (1035), 796 states have internal predecessors, (1035), 84 states have call successors, (84), 15 states have call predecessors, (84), 15 states have return successors, (84), 80 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-22 12:31:27,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1203 transitions. [2024-11-22 12:31:27,702 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1203 transitions. Word has length 115 [2024-11-22 12:31:27,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:31:27,702 INFO L471 AbstractCegarLoop]: Abstraction has 892 states and 1203 transitions. [2024-11-22 12:31:27,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 12:31:27,702 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1203 transitions. [2024-11-22 12:31:27,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-22 12:31:27,703 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:31:27,703 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:31:27,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-22 12:31:27,703 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:31:27,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:31:27,704 INFO L85 PathProgramCache]: Analyzing trace with hash -158264295, now seen corresponding path program 1 times [2024-11-22 12:31:27,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:31:27,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280963798] [2024-11-22 12:31:27,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:31:27,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:31:27,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-22 12:31:27,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [807204479] [2024-11-22 12:31:27,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:31:27,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 12:31:27,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 12:31:27,746 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 12:31:27,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-22 12:31:28,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 12:31:28,028 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 12:31:28,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 12:31:28,179 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 12:31:28,179 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 12:31:28,180 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-22 12:31:28,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-22 12:31:28,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 12:31:28,385 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 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-22 12:31:28,476 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 12:31:28,479 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 12:31:28 BoogieIcfgContainer [2024-11-22 12:31:28,479 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 12:31:28,481 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 12:31:28,481 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 12:31:28,481 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 12:31:28,482 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:30:56" (3/4) ... [2024-11-22 12:31:28,483 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 12:31:28,485 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 12:31:28,485 INFO L158 Benchmark]: Toolchain (without parser) took 32951.54ms. Allocated memory was 144.7MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 73.8MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 6.8MB. Max. memory is 16.1GB. [2024-11-22 12:31:28,485 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 144.7MB. Free memory is still 114.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 12:31:28,485 INFO L158 Benchmark]: CACSL2BoogieTranslator took 335.93ms. Allocated memory was 144.7MB in the beginning and 218.1MB in the end (delta: 73.4MB). Free memory was 73.6MB in the beginning and 182.2MB in the end (delta: -108.6MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. [2024-11-22 12:31:28,487 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.10ms. Allocated memory is still 218.1MB. Free memory was 182.2MB in the beginning and 176.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 12:31:28,487 INFO L158 Benchmark]: Boogie Preprocessor took 81.50ms. Allocated memory is still 218.1MB. Free memory was 176.9MB in the beginning and 171.7MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 12:31:28,488 INFO L158 Benchmark]: RCFGBuilder took 641.15ms. Allocated memory is still 218.1MB. Free memory was 171.7MB in the beginning and 132.9MB in the end (delta: 38.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-11-22 12:31:28,488 INFO L158 Benchmark]: TraceAbstraction took 31839.47ms. Allocated memory was 218.1MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 131.9MB in the beginning and 1.3GB in the end (delta: -1.2GB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 12:31:28,488 INFO L158 Benchmark]: Witness Printer took 3.48ms. Allocated memory is still 1.4GB. Free memory is still 1.3GB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 12:31:28,489 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 144.7MB. Free memory is still 114.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 335.93ms. Allocated memory was 144.7MB in the beginning and 218.1MB in the end (delta: 73.4MB). Free memory was 73.6MB in the beginning and 182.2MB in the end (delta: -108.6MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.10ms. Allocated memory is still 218.1MB. Free memory was 182.2MB in the beginning and 176.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 81.50ms. Allocated memory is still 218.1MB. Free memory was 176.9MB in the beginning and 171.7MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 641.15ms. Allocated memory is still 218.1MB. Free memory was 171.7MB in the beginning and 132.9MB in the end (delta: 38.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 31839.47ms. Allocated memory was 218.1MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 131.9MB in the beginning and 1.3GB in the end (delta: -1.2GB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.48ms. Allocated memory is still 1.4GB. Free memory is still 1.3GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 94, overapproximation of bitwiseOr at line 94, overapproximation of bitwiseAnd at line 51. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 0 }; [L25-L27] float float_Array_0[3] = { 5.8, 0.5, 99.25 }; [L25-L27] float float_Array_0[3] = { 5.8, 0.5, 99.25 }; [L25-L27] float float_Array_0[3] = { 5.8, 0.5, 99.25 }; [L25-L27] float float_Array_0[3] = { 5.8, 0.5, 99.25 }; [L28-L30] signed short int signed_short_int_Array_0[2] = { 5, 18477 }; [L28-L30] signed short int signed_short_int_Array_0[2] = { 5, 18477 }; [L28-L30] signed short int signed_short_int_Array_0[2] = { 5, 18477 }; [L31-L33] unsigned char unsigned_char_Array_0[3] = { 50, 1, 16 }; [L31-L33] unsigned char unsigned_char_Array_0[3] = { 50, 1, 16 }; [L31-L33] unsigned char unsigned_char_Array_0[3] = { 50, 1, 16 }; [L31-L33] unsigned char unsigned_char_Array_0[3] = { 50, 1, 16 }; [L34-L36] unsigned long int unsigned_long_int_Array_0[1] = { 256 }; [L34-L36] unsigned long int unsigned_long_int_Array_0[1] = { 256 }; [L37] unsigned char last_1_unsigned_char_Array_0_2_ = 16; [L38] unsigned long int last_1_unsigned_long_int_Array_0_0_ = 256; VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=0, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L98] isInitial = 1 [L99] FCALL initially() [L100] COND TRUE 1 [L101] CALL updateLastVariables() [L90] EXPR unsigned_char_Array_0[2] [L90] last_1_unsigned_char_Array_0_2_ = unsigned_char_Array_0[2] [L91] EXPR unsigned_long_int_Array_0[0] [L91] last_1_unsigned_long_int_Array_0_0_ = unsigned_long_int_Array_0[0] [L101] RET updateLastVariables() [L102] CALL updateVariables() [L69] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L70] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L70] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L70] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L71] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L71] 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_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L71] 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_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L72] float_Array_0[0] = __VERIFIER_nondet_float() [L73] EXPR float_Array_0[0] [L73] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L73] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F [L73] EXPR float_Array_0[0] [L73] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L73] EXPR (float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L73] EXPR (float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L73] CALL assume_abort_if_not((float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L73] RET assume_abort_if_not((float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L74] float_Array_0[1] = __VERIFIER_nondet_float() [L75] EXPR float_Array_0[1] [L75] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L75] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F [L75] EXPR float_Array_0[1] [L75] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L75] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L75] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L75] CALL assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L75] RET assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] signed_short_int_Array_0[0] = __VERIFIER_nondet_short() [L77] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L77] CALL assume_abort_if_not(signed_short_int_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L77] RET assume_abort_if_not(signed_short_int_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] CALL assume_abort_if_not(signed_short_int_Array_0[0] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] RET assume_abort_if_not(signed_short_int_Array_0[0] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L79] signed_short_int_Array_0[1] = __VERIFIER_nondet_short() [L80] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] CALL assume_abort_if_not(signed_short_int_Array_0[1] >= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] RET assume_abort_if_not(signed_short_int_Array_0[1] >= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L81] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L81] CALL assume_abort_if_not(signed_short_int_Array_0[1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L81] RET assume_abort_if_not(signed_short_int_Array_0[1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L82] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L83] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L83] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L83] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L84] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L84] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L84] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L85] unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L86] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L86] CALL assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L86] RET assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L87] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L87] CALL assume_abort_if_not(unsigned_char_Array_0[1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L87] RET assume_abort_if_not(unsigned_char_Array_0[1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L102] RET updateVariables() [L103] CALL step() [L42] EXPR signed_short_int_Array_0[0] [L42] signed short int stepLocal_3 = signed_short_int_Array_0[0]; [L43] unsigned long int stepLocal_2 = last_1_unsigned_long_int_Array_0_0_; VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, stepLocal_2=256, stepLocal_3=257, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L44] COND FALSE !(last_1_unsigned_long_int_Array_0_0_ > stepLocal_3) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L51] EXPR unsigned_char_Array_0[2] [L51] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L51] EXPR unsigned_char_Array_0[2] & signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, stepLocal_2=256, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L51] EXPR unsigned_char_Array_0[0] [L51] EXPR unsigned_char_Array_0[2] [L51] EXPR unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L51] COND FALSE !((unsigned_char_Array_0[2] & signed_short_int_Array_0[1]) > ((unsigned_char_Array_0[0] * last_1_unsigned_long_int_Array_0_0_) * (unsigned_char_Array_0[2] + unsigned_char_Array_0[2]))) [L56] EXPR signed_short_int_Array_0[1] [L56] unsigned_long_int_Array_0[0] = signed_short_int_Array_0[1] [L58] EXPR unsigned_char_Array_0[2] [L58] unsigned char stepLocal_1 = unsigned_char_Array_0[2]; [L59] EXPR unsigned_char_Array_0[2] [L59] EXPR unsigned_char_Array_0[2] [L59] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L59] EXPR ((unsigned_char_Array_0[2]) > (unsigned_long_int_Array_0[0])) ? (unsigned_char_Array_0[2]) : (unsigned_long_int_Array_0[0]) [L59] EXPR unsigned_long_int_Array_0[0] [L59] EXPR ((unsigned_char_Array_0[2]) > (unsigned_long_int_Array_0[0])) ? (unsigned_char_Array_0[2]) : (unsigned_long_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, stepLocal_1=16, stepLocal_2=256, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L59] EXPR unsigned_char_Array_0[2] ^ ((((unsigned_char_Array_0[2]) > (unsigned_long_int_Array_0[0])) ? (unsigned_char_Array_0[2]) : (unsigned_long_int_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, stepLocal_1=16, stepLocal_2=256, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L59] unsigned long int stepLocal_0 = unsigned_char_Array_0[2] ^ ((((unsigned_char_Array_0[2]) > (unsigned_long_int_Array_0[0])) ? (unsigned_char_Array_0[2]) : (unsigned_long_int_Array_0[0]))); [L60] EXPR unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L60] COND FALSE !(stepLocal_0 != unsigned_char_Array_0[2]) [L65] float_Array_0[2] = 10.5f VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L103] RET step() [L104] CALL, EXPR property() [L94] EXPR unsigned_char_Array_0[2] [L94] EXPR unsigned_char_Array_0[2] [L94] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR ((unsigned_char_Array_0[2]) > (unsigned_long_int_Array_0[0])) ? (unsigned_char_Array_0[2]) : (unsigned_long_int_Array_0[0]) [L94] EXPR unsigned_long_int_Array_0[0] [L94] EXPR ((unsigned_char_Array_0[2]) > (unsigned_long_int_Array_0[0])) ? (unsigned_char_Array_0[2]) : (unsigned_long_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR unsigned_char_Array_0[2] ^ ((((unsigned_char_Array_0[2]) > (unsigned_long_int_Array_0[0])) ? (unsigned_char_Array_0[2]) : (unsigned_long_int_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR ((unsigned_char_Array_0[2] ^ ((((unsigned_char_Array_0[2]) > (unsigned_long_int_Array_0[0])) ? (unsigned_char_Array_0[2]) : (unsigned_long_int_Array_0[0])))) != unsigned_char_Array_0[2]) ? ((unsigned_char_Array_0[2] == (unsigned_char_Array_0[2] - (signed_short_int_Array_0[1] - unsigned_char_Array_0[2]))) ? (float_Array_0[2] == ((float) ((((float_Array_0[0]) < (float_Array_0[1])) ? (float_Array_0[0]) : (float_Array_0[1]))))) : 1) : (float_Array_0[2] == ((float) 10.5f)) [L94] EXPR float_Array_0[2] [L94] EXPR ((unsigned_char_Array_0[2] ^ ((((unsigned_char_Array_0[2]) > (unsigned_long_int_Array_0[0])) ? (unsigned_char_Array_0[2]) : (unsigned_long_int_Array_0[0])))) != unsigned_char_Array_0[2]) ? ((unsigned_char_Array_0[2] == (unsigned_char_Array_0[2] - (signed_short_int_Array_0[1] - unsigned_char_Array_0[2]))) ? (float_Array_0[2] == ((float) ((((float_Array_0[0]) < (float_Array_0[1])) ? (float_Array_0[0]) : (float_Array_0[1]))))) : 1) : (float_Array_0[2] == ((float) 10.5f)) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR (((unsigned_char_Array_0[2] ^ ((((unsigned_char_Array_0[2]) > (unsigned_long_int_Array_0[0])) ? (unsigned_char_Array_0[2]) : (unsigned_long_int_Array_0[0])))) != unsigned_char_Array_0[2]) ? ((unsigned_char_Array_0[2] == (unsigned_char_Array_0[2] - (signed_short_int_Array_0[1] - unsigned_char_Array_0[2]))) ? (float_Array_0[2] == ((float) ((((float_Array_0[0]) < (float_Array_0[1])) ? (float_Array_0[0]) : (float_Array_0[1]))))) : 1) : (float_Array_0[2] == ((float) 10.5f))) && ((last_1_unsigned_long_int_Array_0_0_ > signed_short_int_Array_0[0]) ? ((((last_1_unsigned_char_Array_0_2_ - signed_short_int_Array_0[0]) + signed_short_int_Array_0[1]) > last_1_unsigned_long_int_Array_0_0_) ? (unsigned_char_Array_0[2] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1]))))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[0]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR (((unsigned_char_Array_0[2] ^ ((((unsigned_char_Array_0[2]) > (unsigned_long_int_Array_0[0])) ? (unsigned_char_Array_0[2]) : (unsigned_long_int_Array_0[0])))) != unsigned_char_Array_0[2]) ? ((unsigned_char_Array_0[2] == (unsigned_char_Array_0[2] - (signed_short_int_Array_0[1] - unsigned_char_Array_0[2]))) ? (float_Array_0[2] == ((float) ((((float_Array_0[0]) < (float_Array_0[1])) ? (float_Array_0[0]) : (float_Array_0[1]))))) : 1) : (float_Array_0[2] == ((float) 10.5f))) && ((last_1_unsigned_long_int_Array_0_0_ > signed_short_int_Array_0[0]) ? ((((last_1_unsigned_char_Array_0_2_ - signed_short_int_Array_0[0]) + signed_short_int_Array_0[1]) > last_1_unsigned_long_int_Array_0_0_) ? (unsigned_char_Array_0[2] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1]))))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[0]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR ((((unsigned_char_Array_0[2] ^ ((((unsigned_char_Array_0[2]) > (unsigned_long_int_Array_0[0])) ? (unsigned_char_Array_0[2]) : (unsigned_long_int_Array_0[0])))) != unsigned_char_Array_0[2]) ? ((unsigned_char_Array_0[2] == (unsigned_char_Array_0[2] - (signed_short_int_Array_0[1] - unsigned_char_Array_0[2]))) ? (float_Array_0[2] == ((float) ((((float_Array_0[0]) < (float_Array_0[1])) ? (float_Array_0[0]) : (float_Array_0[1]))))) : 1) : (float_Array_0[2] == ((float) 10.5f))) && ((last_1_unsigned_long_int_Array_0_0_ > signed_short_int_Array_0[0]) ? ((((last_1_unsigned_char_Array_0_2_ - signed_short_int_Array_0[0]) + signed_short_int_Array_0[1]) > last_1_unsigned_long_int_Array_0_0_) ? (unsigned_char_Array_0[2] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1]))))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[0]))) : 1)) && (((unsigned_char_Array_0[2] & signed_short_int_Array_0[1]) > ((unsigned_char_Array_0[0] * last_1_unsigned_long_int_Array_0_0_) * (unsigned_char_Array_0[2] + unsigned_char_Array_0[2]))) ? ((BOOL_unsigned_char_Array_0[0] && (float_Array_0[0] > float_Array_0[1])) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) signed_short_int_Array_0[1])) : 1) : (unsigned_long_int_Array_0[0] == ((unsigned long int) signed_short_int_Array_0[1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR ((((unsigned_char_Array_0[2] ^ ((((unsigned_char_Array_0[2]) > (unsigned_long_int_Array_0[0])) ? (unsigned_char_Array_0[2]) : (unsigned_long_int_Array_0[0])))) != unsigned_char_Array_0[2]) ? ((unsigned_char_Array_0[2] == (unsigned_char_Array_0[2] - (signed_short_int_Array_0[1] - unsigned_char_Array_0[2]))) ? (float_Array_0[2] == ((float) ((((float_Array_0[0]) < (float_Array_0[1])) ? (float_Array_0[0]) : (float_Array_0[1]))))) : 1) : (float_Array_0[2] == ((float) 10.5f))) && ((last_1_unsigned_long_int_Array_0_0_ > signed_short_int_Array_0[0]) ? ((((last_1_unsigned_char_Array_0_2_ - signed_short_int_Array_0[0]) + signed_short_int_Array_0[1]) > last_1_unsigned_long_int_Array_0_0_) ? (unsigned_char_Array_0[2] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1]))))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[0]))) : 1)) && (((unsigned_char_Array_0[2] & signed_short_int_Array_0[1]) > ((unsigned_char_Array_0[0] * last_1_unsigned_long_int_Array_0_0_) * (unsigned_char_Array_0[2] + unsigned_char_Array_0[2]))) ? ((BOOL_unsigned_char_Array_0[0] && (float_Array_0[0] > float_Array_0[1])) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) signed_short_int_Array_0[1])) : 1) : (unsigned_long_int_Array_0[0] == ((unsigned long int) signed_short_int_Array_0[1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94-L95] return ((((unsigned_char_Array_0[2] ^ ((((unsigned_char_Array_0[2]) > (unsigned_long_int_Array_0[0])) ? (unsigned_char_Array_0[2]) : (unsigned_long_int_Array_0[0])))) != unsigned_char_Array_0[2]) ? ((unsigned_char_Array_0[2] == (unsigned_char_Array_0[2] - (signed_short_int_Array_0[1] - unsigned_char_Array_0[2]))) ? (float_Array_0[2] == ((float) ((((float_Array_0[0]) < (float_Array_0[1])) ? (float_Array_0[0]) : (float_Array_0[1]))))) : 1) : (float_Array_0[2] == ((float) 10.5f))) && ((last_1_unsigned_long_int_Array_0_0_ > signed_short_int_Array_0[0]) ? ((((last_1_unsigned_char_Array_0_2_ - signed_short_int_Array_0[0]) + signed_short_int_Array_0[1]) > last_1_unsigned_long_int_Array_0_0_) ? (unsigned_char_Array_0[2] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1]))))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[0]))) : 1)) && (((unsigned_char_Array_0[2] & signed_short_int_Array_0[1]) > ((unsigned_char_Array_0[0] * last_1_unsigned_long_int_Array_0_0_) * (unsigned_char_Array_0[2] + unsigned_char_Array_0[2]))) ? ((BOOL_unsigned_char_Array_0[0] && (float_Array_0[0] > float_Array_0[1])) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) signed_short_int_Array_0[1])) : 1) : (unsigned_long_int_Array_0[0] == ((unsigned long int) signed_short_int_Array_0[1]))) ; [L104] RET, EXPR property() [L104] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 108 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 31.7s, OverallIterations: 30, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 15.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8046 SdHoareTripleChecker+Valid, 8.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8040 mSDsluCounter, 25326 SdHoareTripleChecker+Invalid, 7.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20194 mSDsCounter, 892 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9993 IncrementalHoareTripleChecker+Invalid, 10885 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 892 mSolverCounterUnsat, 5132 mSDtfsCounter, 9993 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 942 GetRequests, 640 SyntacticMatches, 1 SemanticMatches, 301 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1033 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1935occurred in iteration=20, InterpolantAutomatonStates: 253, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.8s AutomataMinimizationTime, 29 MinimizatonAttempts, 5762 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 10.2s InterpolantComputationTime, 3889 NumberOfCodeBlocks, 3889 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 3733 ConstructedInterpolants, 0 QuantifiedInterpolants, 16168 SizeOfPredicates, 5 NumberOfNonLiveVariables, 1635 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 34 InterpolantComputations, 28 PerfectInterpolantSequences, 8843/8976 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-22 12:31:28,559 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/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-18.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 34c00af4b4663198525b0b7086d994deb20901b2017b1e6c2fe4ceb71d985d42 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 12:31:30,609 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 12:31:30,659 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-22 12:31:30,662 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 12:31:30,663 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 12:31:30,678 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 12:31:30,679 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 12:31:30,679 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 12:31:30,679 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 12:31:30,680 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 12:31:30,680 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 12:31:30,680 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 12:31:30,681 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 12:31:30,681 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 12:31:30,681 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 12:31:30,681 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 12:31:30,682 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 12:31:30,682 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 12:31:30,682 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 12:31:30,682 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 12:31:30,683 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 12:31:30,683 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 12:31:30,683 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 12:31:30,683 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 12:31:30,684 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 12:31:30,684 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 12:31:30,684 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 12:31:30,684 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 12:31:30,685 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 12:31:30,685 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 12:31:30,685 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 12:31:30,685 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 12:31:30,686 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 12:31:30,686 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 12:31:30,686 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 12:31:30,686 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 12:31:30,686 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 12:31:30,687 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 12:31:30,687 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 12:31:30,687 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 12:31:30,687 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 12:31:30,688 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 12:31:30,688 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 12:31:30,688 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 12:31:30,688 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 -> 34c00af4b4663198525b0b7086d994deb20901b2017b1e6c2fe4ceb71d985d42 [2024-11-22 12:31:30,955 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 12:31:30,971 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 12:31:30,973 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 12:31:30,974 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 12:31:30,975 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 12:31:30,976 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-18.i [2024-11-22 12:31:32,245 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 12:31:32,398 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 12:31:32,399 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-18.i [2024-11-22 12:31:32,407 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adf7f0d06/611cf3df958b4a65bb53b52daee192bd/FLAG417136400 [2024-11-22 12:31:32,813 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adf7f0d06/611cf3df958b4a65bb53b52daee192bd [2024-11-22 12:31:32,815 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 12:31:32,816 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 12:31:32,817 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 12:31:32,817 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 12:31:32,821 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 12:31:32,823 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:31:32" (1/1) ... [2024-11-22 12:31:32,825 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@636a9e24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:31:32, skipping insertion in model container [2024-11-22 12:31:32,825 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:31:32" (1/1) ... [2024-11-22 12:31:32,849 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 12:31:33,022 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-18.i[916,929] [2024-11-22 12:31:33,083 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 12:31:33,128 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 12:31:33,142 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-18.i[916,929] [2024-11-22 12:31:33,184 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 12:31:33,204 INFO L204 MainTranslator]: Completed translation [2024-11-22 12:31:33,204 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:31:33 WrapperNode [2024-11-22 12:31:33,204 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 12:31:33,205 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 12:31:33,205 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 12:31:33,205 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 12:31:33,210 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:31:33" (1/1) ... [2024-11-22 12:31:33,228 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:31:33" (1/1) ... [2024-11-22 12:31:33,265 INFO L138 Inliner]: procedures = 36, calls = 143, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 440 [2024-11-22 12:31:33,265 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 12:31:33,266 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 12:31:33,266 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 12:31:33,266 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 12:31:33,276 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:31:33" (1/1) ... [2024-11-22 12:31:33,276 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:31:33" (1/1) ... [2024-11-22 12:31:33,282 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:31:33" (1/1) ... [2024-11-22 12:31:33,298 INFO L175 MemorySlicer]: Split 115 memory accesses to 6 slices as follows [2, 6, 29, 22, 46, 10]. 40 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 3, 2, 3, 1]. The 13 writes are split as follows [0, 1, 4, 2, 4, 2]. [2024-11-22 12:31:33,298 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:31:33" (1/1) ... [2024-11-22 12:31:33,298 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:31:33" (1/1) ... [2024-11-22 12:31:33,311 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:31:33" (1/1) ... [2024-11-22 12:31:33,314 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:31:33" (1/1) ... [2024-11-22 12:31:33,320 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:31:33" (1/1) ... [2024-11-22 12:31:33,322 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:31:33" (1/1) ... [2024-11-22 12:31:33,328 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 12:31:33,329 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 12:31:33,329 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 12:31:33,329 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 12:31:33,330 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:31:33" (1/1) ... [2024-11-22 12:31:33,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 12:31:33,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 12:31:33,355 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-22 12:31:33,357 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-22 12:31:33,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 12:31:33,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-22 12:31:33,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-22 12:31:33,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-22 12:31:33,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-22 12:31:33,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-22 12:31:33,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-22 12:31:33,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-22 12:31:33,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-22 12:31:33,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-22 12:31:33,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-22 12:31:33,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-22 12:31:33,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-22 12:31:33,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 12:31:33,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-22 12:31:33,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-22 12:31:33,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-22 12:31:33,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-22 12:31:33,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-22 12:31:33,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-22 12:31:33,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-22 12:31:33,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-22 12:31:33,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-22 12:31:33,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-22 12:31:33,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-22 12:31:33,406 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-22 12:31:33,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-22 12:31:33,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-22 12:31:33,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-22 12:31:33,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-22 12:31:33,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-22 12:31:33,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-22 12:31:33,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-22 12:31:33,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-22 12:31:33,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-22 12:31:33,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-22 12:31:33,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-22 12:31:33,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-22 12:31:33,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-22 12:31:33,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-22 12:31:33,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-22 12:31:33,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-22 12:31:33,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-11-22 12:31:33,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-22 12:31:33,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-22 12:31:33,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-22 12:31:33,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-22 12:31:33,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-22 12:31:33,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-22 12:31:33,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-22 12:31:33,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-22 12:31:33,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-22 12:31:33,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-22 12:31:33,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-22 12:31:33,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-11-22 12:31:33,409 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 12:31:33,409 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 12:31:33,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 12:31:33,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 12:31:33,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-22 12:31:33,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-22 12:31:33,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-22 12:31:33,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-22 12:31:33,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-22 12:31:33,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-22 12:31:33,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-22 12:31:33,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-22 12:31:33,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-22 12:31:33,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-22 12:31:33,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-22 12:31:33,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-11-22 12:31:33,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-22 12:31:33,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-22 12:31:33,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-22 12:31:33,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-22 12:31:33,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-22 12:31:33,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-22 12:31:33,534 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 12:31:33,536 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 12:31:34,071 INFO L? ?]: Removed 124 outVars from TransFormulas that were not future-live. [2024-11-22 12:31:34,071 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 12:31:34,081 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 12:31:34,083 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 12:31:34,083 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:31:34 BoogieIcfgContainer [2024-11-22 12:31:34,083 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 12:31:34,084 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 12:31:34,085 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 12:31:34,087 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 12:31:34,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 12:31:32" (1/3) ... [2024-11-22 12:31:34,088 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d2eccfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:31:34, skipping insertion in model container [2024-11-22 12:31:34,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:31:33" (2/3) ... [2024-11-22 12:31:34,088 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d2eccfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:31:34, skipping insertion in model container [2024-11-22 12:31:34,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:31:34" (3/3) ... [2024-11-22 12:31:34,089 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-18.i [2024-11-22 12:31:34,110 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 12:31:34,110 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 12:31:34,157 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 12:31:34,162 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;@4d304c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 12:31:34,162 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 12:31:34,166 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 77 states have (on average 1.4285714285714286) internal successors, (110), 78 states have internal predecessors, (110), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-22 12:31:34,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-22 12:31:34,174 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:31:34,175 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:31:34,175 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:31:34,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:31:34,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1283831834, now seen corresponding path program 1 times [2024-11-22 12:31:34,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:31:34,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1830089510] [2024-11-22 12:31:34,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:31:34,190 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-22 12:31:34,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:31:34,196 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-22 12:31:34,201 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-22 12:31:34,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:31:34,468 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 12:31:34,479 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:31:34,515 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2024-11-22 12:31:34,516 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:31:34,517 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:31:34,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1830089510] [2024-11-22 12:31:34,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1830089510] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:31:34,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:31:34,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 12:31:34,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116428739] [2024-11-22 12:31:34,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:31:34,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 12:31:34,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:31:34,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 12:31:34,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 12:31:34,546 INFO L87 Difference]: Start difference. First operand has 92 states, 77 states have (on average 1.4285714285714286) internal successors, (110), 78 states have internal predecessors, (110), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-22 12:31:34,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:31:34,567 INFO L93 Difference]: Finished difference Result 177 states and 274 transitions. [2024-11-22 12:31:34,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 12:31:34,570 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 103 [2024-11-22 12:31:34,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:31:34,576 INFO L225 Difference]: With dead ends: 177 [2024-11-22 12:31:34,577 INFO L226 Difference]: Without dead ends: 88 [2024-11-22 12:31:34,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 102 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-22 12:31:34,582 INFO L432 NwaCegarLoop]: 127 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, 127 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-22 12:31:34,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:31:34,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-22 12:31:34,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-22 12:31:34,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 74 states have (on average 1.3918918918918919) internal successors, (103), 74 states have internal predecessors, (103), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-22 12:31:34,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 127 transitions. [2024-11-22 12:31:34,618 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 127 transitions. Word has length 103 [2024-11-22 12:31:34,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:31:34,619 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 127 transitions. [2024-11-22 12:31:34,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-22 12:31:34,619 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 127 transitions. [2024-11-22 12:31:34,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-22 12:31:34,622 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:31:34,622 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:31:34,629 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-22 12:31:34,826 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-22 12:31:34,827 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:31:34,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:31:34,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1144304698, now seen corresponding path program 1 times [2024-11-22 12:31:34,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:31:34,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [405775420] [2024-11-22 12:31:34,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:31:34,829 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-22 12:31:34,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:31:34,832 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-22 12:31:34,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-22 12:31:35,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:31:35,048 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 12:31:35,052 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:31:35,097 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-22 12:31:35,097 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:31:35,097 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:31:35,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [405775420] [2024-11-22 12:31:35,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [405775420] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:31:35,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:31:35,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 12:31:35,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17439830] [2024-11-22 12:31:35,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:31:35,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 12:31:35,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:31:35,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 12:31:35,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 12:31:35,100 INFO L87 Difference]: Start difference. First operand 88 states and 127 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-22 12:31:35,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:31:35,137 INFO L93 Difference]: Finished difference Result 175 states and 254 transitions. [2024-11-22 12:31:35,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 12:31:35,137 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 103 [2024-11-22 12:31:35,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:31:35,138 INFO L225 Difference]: With dead ends: 175 [2024-11-22 12:31:35,138 INFO L226 Difference]: Without dead ends: 90 [2024-11-22 12:31:35,139 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 100 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-22 12:31:35,140 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:31:35,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 364 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:31:35,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-22 12:31:35,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-22 12:31:35,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 76 states have (on average 1.381578947368421) internal successors, (105), 76 states have internal predecessors, (105), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-22 12:31:35,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 129 transitions. [2024-11-22 12:31:35,148 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 129 transitions. Word has length 103 [2024-11-22 12:31:35,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:31:35,149 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 129 transitions. [2024-11-22 12:31:35,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-22 12:31:35,149 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 129 transitions. [2024-11-22 12:31:35,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-22 12:31:35,151 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:31:35,151 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:31:35,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-22 12:31:35,354 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-22 12:31:35,358 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:31:35,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:31:35,359 INFO L85 PathProgramCache]: Analyzing trace with hash 814270088, now seen corresponding path program 1 times [2024-11-22 12:31:35,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:31:35,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [518887706] [2024-11-22 12:31:35,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:31:35,359 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-22 12:31:35,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:31:35,362 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-22 12:31:35,363 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-22 12:31:35,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:31:35,605 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-22 12:31:35,611 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:31:35,806 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 31 treesize of output 19 [2024-11-22 12:31:35,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-22 12:31:35,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-22 12:31:35,944 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 143 proven. 15 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-11-22 12:31:35,945 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:31:36,046 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:31:36,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [518887706] [2024-11-22 12:31:36,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [518887706] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 12:31:36,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [961367863] [2024-11-22 12:31:36,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:31:36,047 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-22 12:31:36,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-22 12:31:36,050 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-22 12:31:36,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-22 12:31:36,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:31:36,492 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-22 12:31:36,497 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:31:36,590 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-22 12:31:36,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-22 12:31:36,883 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 23 treesize of output 15 [2024-11-22 12:31:36,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-22 12:31:36,929 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 143 proven. 15 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-11-22 12:31:36,929 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:31:36,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [961367863] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 12:31:36,956 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 12:31:36,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2024-11-22 12:31:36,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394776390] [2024-11-22 12:31:36,957 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 12:31:36,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-22 12:31:36,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:31:36,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-22 12:31:36,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-22 12:31:36,958 INFO L87 Difference]: Start difference. First operand 90 states and 129 transitions. Second operand has 13 states, 11 states have (on average 8.0) internal successors, (88), 13 states have internal predecessors, (88), 6 states have call successors, (24), 4 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) [2024-11-22 12:31:38,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:31:38,060 INFO L93 Difference]: Finished difference Result 276 states and 391 transitions. [2024-11-22 12:31:38,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-22 12:31:38,061 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 8.0) internal successors, (88), 13 states have internal predecessors, (88), 6 states have call successors, (24), 4 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) Word has length 103 [2024-11-22 12:31:38,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:31:38,067 INFO L225 Difference]: With dead ends: 276 [2024-11-22 12:31:38,067 INFO L226 Difference]: Without dead ends: 189 [2024-11-22 12:31:38,069 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 236 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=190, Invalid=680, Unknown=0, NotChecked=0, Total=870 [2024-11-22 12:31:38,069 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 248 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-22 12:31:38,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 953 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-22 12:31:38,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-11-22 12:31:38,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 183. [2024-11-22 12:31:38,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 154 states have (on average 1.37012987012987) internal successors, (211), 154 states have internal predecessors, (211), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-22 12:31:38,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 259 transitions. [2024-11-22 12:31:38,111 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 259 transitions. Word has length 103 [2024-11-22 12:31:38,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:31:38,111 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 259 transitions. [2024-11-22 12:31:38,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 8.0) internal successors, (88), 13 states have internal predecessors, (88), 6 states have call successors, (24), 4 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) [2024-11-22 12:31:38,112 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 259 transitions. [2024-11-22 12:31:38,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-22 12:31:38,113 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:31:38,113 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:31:38,124 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-22 12:31:38,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Forceful destruction successful, exit code 0 [2024-11-22 12:31:38,524 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,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-22 12:31:38,525 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:31:38,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:31:38,526 INFO L85 PathProgramCache]: Analyzing trace with hash -465593590, now seen corresponding path program 1 times [2024-11-22 12:31:38,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:31:38,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [895786574] [2024-11-22 12:31:38,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:31:38,528 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-22 12:31:38,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:31:38,534 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-22 12:31:38,535 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-22 12:31:38,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:31:38,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-22 12:31:38,730 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:31:38,854 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 31 treesize of output 19 [2024-11-22 12:31:38,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-22 12:31:38,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-22 12:31:38,935 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 143 proven. 15 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-11-22 12:31:38,935 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:31:39,070 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:31:39,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [895786574] [2024-11-22 12:31:39,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [895786574] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 12:31:39,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [14018292] [2024-11-22 12:31:39,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:31:39,070 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-22 12:31:39,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-22 12:31:39,072 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-22 12:31:39,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-11-22 12:31:39,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:31:39,471 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-22 12:31:39,474 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:31:39,553 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-22 12:31:39,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-22 12:31:39,962 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 31 treesize of output 19 [2024-11-22 12:31:39,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-22 12:31:40,018 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 149 proven. 15 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-22 12:31:40,018 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:31:40,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [14018292] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 12:31:40,054 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 12:31:40,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 15 [2024-11-22 12:31:40,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687840993] [2024-11-22 12:31:40,055 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 12:31:40,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-22 12:31:40,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:31:40,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-22 12:31:40,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2024-11-22 12:31:40,056 INFO L87 Difference]: Start difference. First operand 183 states and 259 transitions. Second operand has 15 states, 13 states have (on average 6.769230769230769) internal successors, (88), 14 states have internal predecessors, (88), 6 states have call successors, (24), 5 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) [2024-11-22 12:31:41,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:31:41,548 INFO L93 Difference]: Finished difference Result 280 states and 392 transitions. [2024-11-22 12:31:41,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-22 12:31:41,549 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.769230769230769) internal successors, (88), 14 states have internal predecessors, (88), 6 states have call successors, (24), 5 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) Word has length 103 [2024-11-22 12:31:41,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:31:41,552 INFO L225 Difference]: With dead ends: 280 [2024-11-22 12:31:41,556 INFO L226 Difference]: Without dead ends: 189 [2024-11-22 12:31:41,557 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 232 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=229, Invalid=893, Unknown=0, NotChecked=0, Total=1122 [2024-11-22 12:31:41,557 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 521 mSDsluCounter, 829 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:31:41,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [528 Valid, 969 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-22 12:31:41,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-11-22 12:31:41,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 183. [2024-11-22 12:31:41,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 154 states have (on average 1.3636363636363635) internal successors, (210), 154 states have internal predecessors, (210), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-22 12:31:41,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 258 transitions. [2024-11-22 12:31:41,593 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 258 transitions. Word has length 103 [2024-11-22 12:31:41,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:31:41,593 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 258 transitions. [2024-11-22 12:31:41,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.769230769230769) internal successors, (88), 14 states have internal predecessors, (88), 6 states have call successors, (24), 5 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) [2024-11-22 12:31:41,593 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 258 transitions. [2024-11-22 12:31:41,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-22 12:31:41,603 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:31:41,603 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:31:41,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2024-11-22 12:31:41,809 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-22 12:31:42,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-22 12:31:42,008 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:31:42,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:31:42,009 INFO L85 PathProgramCache]: Analyzing trace with hash 58106553, now seen corresponding path program 1 times [2024-11-22 12:31:42,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:31:42,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [132431475] [2024-11-22 12:31:42,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:31:42,013 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-22 12:31:42,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:31:42,014 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-22 12:31:42,016 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-22 12:31:42,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:31:42,221 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-22 12:31:42,227 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:31:42,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2024-11-22 12:31:42,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2024-11-22 12:31:42,393 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-22 12:31:42,393 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:31:42,393 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:31:42,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [132431475] [2024-11-22 12:31:42,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [132431475] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:31:42,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:31:42,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-22 12:31:42,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363121480] [2024-11-22 12:31:42,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:31:42,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 12:31:42,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:31:42,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 12:31:42,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-22 12:31:42,398 INFO L87 Difference]: Start difference. First operand 183 states and 258 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 12:31:43,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:31:43,020 INFO L93 Difference]: Finished difference Result 373 states and 526 transitions. [2024-11-22 12:31:43,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-22 12:31:43,021 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2024-11-22 12:31:43,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:31:43,024 INFO L225 Difference]: With dead ends: 373 [2024-11-22 12:31:43,025 INFO L226 Difference]: Without dead ends: 193 [2024-11-22 12:31:43,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-11-22 12:31:43,026 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 126 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 12:31:43,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 542 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-22 12:31:43,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-22 12:31:43,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 189. [2024-11-22 12:31:43,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 160 states have (on average 1.35) internal successors, (216), 160 states have internal predecessors, (216), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-22 12:31:43,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 264 transitions. [2024-11-22 12:31:43,064 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 264 transitions. Word has length 104 [2024-11-22 12:31:43,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:31:43,064 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 264 transitions. [2024-11-22 12:31:43,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 12:31:43,064 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 264 transitions. [2024-11-22 12:31:43,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-22 12:31:43,068 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:31:43,068 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:31:43,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 (8)] Ended with exit code 0 [2024-11-22 12:31:43,272 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-22 12:31:43,273 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:31:43,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:31:43,273 INFO L85 PathProgramCache]: Analyzing trace with hash -642958025, now seen corresponding path program 1 times [2024-11-22 12:31:43,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:31:43,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1637025023] [2024-11-22 12:31:43,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:31:43,274 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-22 12:31:43,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:31:43,277 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-22 12:31:43,278 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-22 12:31:43,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:31:43,454 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-22 12:31:43,460 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:31:43,580 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 31 treesize of output 19 [2024-11-22 12:31:43,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-22 12:31:43,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-22 12:31:43,656 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 143 proven. 15 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-11-22 12:31:43,656 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:31:43,747 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:31:43,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1637025023] [2024-11-22 12:31:43,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1637025023] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 12:31:43,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1137159874] [2024-11-22 12:31:43,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:31:43,747 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-22 12:31:43,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-22 12:31:43,749 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-22 12:31:43,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2024-11-22 12:31:44,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:31:44,150 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-22 12:31:44,153 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:31:44,228 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-22 12:31:44,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-22 12:31:44,613 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 31 treesize of output 19 [2024-11-22 12:31:44,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 17 treesize of output 9 [2024-11-22 12:31:44,656 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 149 proven. 15 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-22 12:31:44,656 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:31:44,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1137159874] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 12:31:44,708 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 12:31:44,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2024-11-22 12:31:44,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944300174] [2024-11-22 12:31:44,709 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 12:31:44,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-22 12:31:44,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:31:44,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-22 12:31:44,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2024-11-22 12:31:44,713 INFO L87 Difference]: Start difference. First operand 189 states and 264 transitions. Second operand has 14 states, 12 states have (on average 7.416666666666667) internal successors, (89), 13 states have internal predecessors, (89), 6 states have call successors, (24), 5 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) [2024-11-22 12:31:45,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:31:45,780 INFO L93 Difference]: Finished difference Result 286 states and 395 transitions. [2024-11-22 12:31:45,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-22 12:31:45,780 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.416666666666667) internal successors, (89), 13 states have internal predecessors, (89), 6 states have call successors, (24), 5 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) Word has length 104 [2024-11-22 12:31:45,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:31:45,787 INFO L225 Difference]: With dead ends: 286 [2024-11-22 12:31:45,787 INFO L226 Difference]: Without dead ends: 193 [2024-11-22 12:31:45,787 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 239 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=211, Invalid=719, Unknown=0, NotChecked=0, Total=930 [2024-11-22 12:31:45,788 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 209 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 980 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-22 12:31:45,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 980 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-22 12:31:45,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-22 12:31:45,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 187. [2024-11-22 12:31:45,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 158 states have (on average 1.3417721518987342) internal successors, (212), 158 states have internal predecessors, (212), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-22 12:31:45,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 260 transitions. [2024-11-22 12:31:45,806 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 260 transitions. Word has length 104 [2024-11-22 12:31:45,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:31:45,806 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 260 transitions. [2024-11-22 12:31:45,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.416666666666667) internal successors, (89), 13 states have internal predecessors, (89), 6 states have call successors, (24), 5 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) [2024-11-22 12:31:45,807 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 260 transitions. [2024-11-22 12:31:45,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-22 12:31:45,807 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:31:45,807 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:31:45,814 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-22 12:31:46,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2024-11-22 12:31:46,211 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,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-22 12:31:46,213 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:31:46,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:31:46,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1803994592, now seen corresponding path program 1 times [2024-11-22 12:31:46,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:31:46,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [637075889] [2024-11-22 12:31:46,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:31:46,214 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:31:46,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:31:46,217 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-22 12:31:46,218 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-22 12:31:46,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:31:46,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 12:31:46,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:31:46,511 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-22 12:31:46,511 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:31:46,511 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:31:46,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [637075889] [2024-11-22 12:31:46,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [637075889] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:31:46,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:31:46,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 12:31:46,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985353537] [2024-11-22 12:31:46,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:31:46,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 12:31:46,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:31:46,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 12:31:46,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 12:31:46,512 INFO L87 Difference]: Start difference. First operand 187 states and 260 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 12:31:46,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:31:46,622 INFO L93 Difference]: Finished difference Result 371 states and 515 transitions. [2024-11-22 12:31:46,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 12:31:46,622 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 105 [2024-11-22 12:31:46,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:31:46,623 INFO L225 Difference]: With dead ends: 371 [2024-11-22 12:31:46,624 INFO L226 Difference]: Without dead ends: 187 [2024-11-22 12:31:46,624 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 102 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-22 12:31:46,624 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 67 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 12:31:46,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 375 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 12:31:46,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-22 12:31:46,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2024-11-22 12:31:46,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 156 states have (on average 1.3333333333333333) internal successors, (208), 156 states have internal predecessors, (208), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-22 12:31:46,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 256 transitions. [2024-11-22 12:31:46,637 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 256 transitions. Word has length 105 [2024-11-22 12:31:46,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:31:46,637 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 256 transitions. [2024-11-22 12:31:46,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 12:31:46,637 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 256 transitions. [2024-11-22 12:31:46,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-22 12:31:46,638 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:31:46,638 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:31:46,645 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-22 12:31:46,842 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-22 12:31:46,843 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:31:46,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:31:46,843 INFO L85 PathProgramCache]: Analyzing trace with hash 231895965, now seen corresponding path program 1 times [2024-11-22 12:31:46,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:31:46,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [790733897] [2024-11-22 12:31:46,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:31:46,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-22 12:31:46,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:31:46,848 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-22 12:31:46,851 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-22 12:31:47,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:31:47,013 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 12:31:47,016 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:31:47,182 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-22 12:31:47,182 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:31:47,182 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:31:47,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [790733897] [2024-11-22 12:31:47,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [790733897] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:31:47,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:31:47,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 12:31:47,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851146287] [2024-11-22 12:31:47,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:31:47,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 12:31:47,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:31:47,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 12:31:47,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 12:31:47,184 INFO L87 Difference]: Start difference. First operand 185 states and 256 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 12:31:47,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:31:47,311 INFO L93 Difference]: Finished difference Result 367 states and 507 transitions. [2024-11-22 12:31:47,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 12:31:47,312 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 106 [2024-11-22 12:31:47,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:31:47,313 INFO L225 Difference]: With dead ends: 367 [2024-11-22 12:31:47,313 INFO L226 Difference]: Without dead ends: 185 [2024-11-22 12:31:47,314 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 103 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-22 12:31:47,314 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 60 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 12:31:47,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 429 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 12:31:47,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-22 12:31:47,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 94. [2024-11-22 12:31:47,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 79 states have (on average 1.3164556962025316) internal successors, (104), 79 states have internal predecessors, (104), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-22 12:31:47,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 128 transitions. [2024-11-22 12:31:47,322 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 128 transitions. Word has length 106 [2024-11-22 12:31:47,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:31:47,322 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 128 transitions. [2024-11-22 12:31:47,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 12:31:47,322 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 128 transitions. [2024-11-22 12:31:47,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-22 12:31:47,323 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:31:47,323 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:31:47,333 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-22 12:31:47,525 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-22 12:31:47,525 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:31:47,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:31:47,526 INFO L85 PathProgramCache]: Analyzing trace with hash 2031708747, now seen corresponding path program 1 times [2024-11-22 12:31:47,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:31:47,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [954213287] [2024-11-22 12:31:47,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:31:47,526 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-22 12:31:47,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:31:47,529 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-22 12:31:47,530 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-22 12:31:47,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:31:47,697 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 12:31:47,699 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:31:47,712 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-22 12:31:47,712 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:31:47,713 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:31:47,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [954213287] [2024-11-22 12:31:47,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [954213287] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:31:47,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:31:47,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 12:31:47,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938446715] [2024-11-22 12:31:47,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:31:47,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 12:31:47,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:31:47,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 12:31:47,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 12:31:47,714 INFO L87 Difference]: Start difference. First operand 94 states and 128 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 12:31:47,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:31:47,753 INFO L93 Difference]: Finished difference Result 188 states and 257 transitions. [2024-11-22 12:31:47,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 12:31:47,756 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 106 [2024-11-22 12:31:47,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:31:47,757 INFO L225 Difference]: With dead ends: 188 [2024-11-22 12:31:47,757 INFO L226 Difference]: Without dead ends: 97 [2024-11-22 12:31:47,757 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 12:31:47,759 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:31:47,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 466 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:31:47,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-22 12:31:47,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-22 12:31:47,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 82 states have (on average 1.3048780487804879) internal successors, (107), 82 states have internal predecessors, (107), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-22 12:31:47,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 131 transitions. [2024-11-22 12:31:47,774 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 131 transitions. Word has length 106 [2024-11-22 12:31:47,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:31:47,774 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 131 transitions. [2024-11-22 12:31:47,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 12:31:47,774 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 131 transitions. [2024-11-22 12:31:47,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-22 12:31:47,775 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:31:47,775 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:31:47,785 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-22 12:31:47,978 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-22 12:31:47,978 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:31:47,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:31:47,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1432824362, now seen corresponding path program 1 times [2024-11-22 12:31:47,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:31:47,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1223007868] [2024-11-22 12:31:47,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:31:47,979 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-22 12:31:47,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:31:47,980 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-22 12:31:47,982 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-22 12:31:48,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:31:48,194 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 12:31:48,196 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:31:48,220 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-22 12:31:48,221 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:31:48,221 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:31:48,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1223007868] [2024-11-22 12:31:48,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1223007868] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:31:48,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:31:48,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 12:31:48,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323417339] [2024-11-22 12:31:48,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:31:48,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 12:31:48,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:31:48,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 12:31:48,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 12:31:48,222 INFO L87 Difference]: Start difference. First operand 97 states and 131 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 12:31:48,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:31:48,265 INFO L93 Difference]: Finished difference Result 194 states and 263 transitions. [2024-11-22 12:31:48,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 12:31:48,270 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2024-11-22 12:31:48,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:31:48,270 INFO L225 Difference]: With dead ends: 194 [2024-11-22 12:31:48,270 INFO L226 Difference]: Without dead ends: 100 [2024-11-22 12:31:48,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 12:31:48,271 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:31:48,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 464 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:31:48,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-22 12:31:48,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-22 12:31:48,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 85 states have (on average 1.2941176470588236) internal successors, (110), 85 states have internal predecessors, (110), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-22 12:31:48,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 134 transitions. [2024-11-22 12:31:48,286 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 134 transitions. Word has length 108 [2024-11-22 12:31:48,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:31:48,286 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 134 transitions. [2024-11-22 12:31:48,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 12:31:48,287 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 134 transitions. [2024-11-22 12:31:48,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-22 12:31:48,288 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:31:48,288 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:31:48,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-11-22 12:31:48,492 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-22 12:31:48,492 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:31:48,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:31:48,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1971554096, now seen corresponding path program 1 times [2024-11-22 12:31:48,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:31:48,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [585751394] [2024-11-22 12:31:48,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:31:48,493 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-22 12:31:48,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:31:48,498 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-22 12:31:48,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 (15)] Waiting until timeout for monitored process [2024-11-22 12:31:48,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:31:48,670 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-22 12:31:48,673 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:31:48,756 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 55 treesize of output 31 [2024-11-22 12:31:48,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2024-11-22 12:31:48,790 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-22 12:31:48,790 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:31:48,790 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:31:48,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [585751394] [2024-11-22 12:31:48,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [585751394] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:31:48,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:31:48,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 12:31:48,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250054810] [2024-11-22 12:31:48,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:31:48,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 12:31:48,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:31:48,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 12:31:48,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-22 12:31:48,791 INFO L87 Difference]: Start difference. First operand 100 states and 134 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 12:31:49,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:31:49,154 INFO L93 Difference]: Finished difference Result 257 states and 344 transitions. [2024-11-22 12:31:49,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 12:31:49,154 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2024-11-22 12:31:49,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:31:49,159 INFO L225 Difference]: With dead ends: 257 [2024-11-22 12:31:49,159 INFO L226 Difference]: Without dead ends: 160 [2024-11-22 12:31:49,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-22 12:31:49,160 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 70 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 12:31:49,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 362 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 12:31:49,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-22 12:31:49,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 157. [2024-11-22 12:31:49,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 135 states have (on average 1.288888888888889) internal successors, (174), 136 states have internal predecessors, (174), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-22 12:31:49,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 210 transitions. [2024-11-22 12:31:49,182 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 210 transitions. Word has length 108 [2024-11-22 12:31:49,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:31:49,182 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 210 transitions. [2024-11-22 12:31:49,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 12:31:49,182 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 210 transitions. [2024-11-22 12:31:49,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-22 12:31:49,183 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:31:49,183 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:31:49,197 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-22 12:31:49,383 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-22 12:31:49,384 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:31:49,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:31:49,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1042120196, now seen corresponding path program 1 times [2024-11-22 12:31:49,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:31:49,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1723915606] [2024-11-22 12:31:49,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:31:49,385 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-22 12:31:49,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:31:49,386 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-22 12:31:49,387 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-22 12:31:49,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:31:49,569 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 12:31:49,571 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:31:49,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-22 12:31:50,352 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-22 12:31:50,352 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:31:50,352 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:31:50,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1723915606] [2024-11-22 12:31:50,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1723915606] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:31:50,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:31:50,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 12:31:50,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950315996] [2024-11-22 12:31:50,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:31:50,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 12:31:50,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:31:50,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 12:31:50,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-22 12:31:50,354 INFO L87 Difference]: Start difference. First operand 157 states and 210 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 12:31:52,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-22 12:31:54,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-22 12:31:57,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-22 12:31:59,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.82s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-22 12:32:01,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-22 12:32:05,115 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-22 12:32:07,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:32:07,029 INFO L93 Difference]: Finished difference Result 711 states and 941 transitions. [2024-11-22 12:32:07,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 12:32:07,032 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2024-11-22 12:32:07,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:32:07,036 INFO L225 Difference]: With dead ends: 711 [2024-11-22 12:32:07,037 INFO L226 Difference]: Without dead ends: 557 [2024-11-22 12:32:07,037 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-11-22 12:32:07,038 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 303 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 34 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.5s IncrementalHoareTripleChecker+Time [2024-11-22 12:32:07,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 747 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 275 Invalid, 4 Unknown, 0 Unchecked, 16.5s Time] [2024-11-22 12:32:07,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2024-11-22 12:32:07,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 449. [2024-11-22 12:32:07,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 396 states have (on average 1.2828282828282829) internal successors, (508), 400 states have internal predecessors, (508), 44 states have call successors, (44), 8 states have call predecessors, (44), 8 states have return successors, (44), 40 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-22 12:32:07,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 596 transitions. [2024-11-22 12:32:07,070 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 596 transitions. Word has length 110 [2024-11-22 12:32:07,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:32:07,070 INFO L471 AbstractCegarLoop]: Abstraction has 449 states and 596 transitions. [2024-11-22 12:32:07,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 12:32:07,070 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 596 transitions. [2024-11-22 12:32:07,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-22 12:32:07,071 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:32:07,071 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:32:07,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 (16)] Forceful destruction successful, exit code 0 [2024-11-22 12:32:07,271 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-22 12:32:07,272 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:32:07,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:32:07,273 INFO L85 PathProgramCache]: Analyzing trace with hash -782383678, now seen corresponding path program 1 times [2024-11-22 12:32:07,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:32:07,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [250266832] [2024-11-22 12:32:07,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:32:07,273 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-22 12:32:07,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:32:07,275 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-22 12:32:07,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 (17)] Waiting until timeout for monitored process [2024-11-22 12:32:07,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:32:07,466 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-22 12:32:07,469 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:32:07,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2024-11-22 12:32:07,547 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-22 12:32:07,547 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:32:07,547 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:32:07,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [250266832] [2024-11-22 12:32:07,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [250266832] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:32:07,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:32:07,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 12:32:07,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18995072] [2024-11-22 12:32:07,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:32:07,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 12:32:07,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:32:07,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 12:32:07,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-22 12:32:07,549 INFO L87 Difference]: Start difference. First operand 449 states and 596 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 12:32:07,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:32:07,807 INFO L93 Difference]: Finished difference Result 588 states and 778 transitions. [2024-11-22 12:32:07,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 12:32:07,807 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2024-11-22 12:32:07,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:32:07,810 INFO L225 Difference]: With dead ends: 588 [2024-11-22 12:32:07,810 INFO L226 Difference]: Without dead ends: 586 [2024-11-22 12:32:07,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-22 12:32:07,810 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 72 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 12:32:07,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 811 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 12:32:07,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2024-11-22 12:32:07,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 486. [2024-11-22 12:32:07,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 433 states have (on average 1.28175519630485) internal successors, (555), 437 states have internal predecessors, (555), 44 states have call successors, (44), 8 states have call predecessors, (44), 8 states have return successors, (44), 40 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-22 12:32:07,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 643 transitions. [2024-11-22 12:32:07,836 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 643 transitions. Word has length 110 [2024-11-22 12:32:07,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:32:07,837 INFO L471 AbstractCegarLoop]: Abstraction has 486 states and 643 transitions. [2024-11-22 12:32:07,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 12:32:07,837 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 643 transitions. [2024-11-22 12:32:07,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-22 12:32:07,838 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:32:07,838 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:32:07,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2024-11-22 12:32:08,041 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-22 12:32:08,042 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:32:08,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:32:08,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1695174517, now seen corresponding path program 1 times [2024-11-22 12:32:08,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:32:08,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2094276912] [2024-11-22 12:32:08,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:32:08,042 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-22 12:32:08,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:32:08,045 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-22 12:32:08,046 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-22 12:32:08,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:32:08,227 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 12:32:08,229 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:32:08,320 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 22 treesize of output 10 [2024-11-22 12:32:08,338 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 143 proven. 15 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-11-22 12:32:08,338 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:32:08,426 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:32:08,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2094276912] [2024-11-22 12:32:08,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2094276912] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 12:32:08,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [75989600] [2024-11-22 12:32:08,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:32:08,427 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-22 12:32:08,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-22 12:32:08,429 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-22 12:32:08,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2024-11-22 12:32:09,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:32:09,099 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-22 12:32:09,101 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:32:09,172 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-22 12:32:09,389 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-22 12:32:09,407 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 143 proven. 15 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-11-22 12:32:09,407 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:32:09,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [75989600] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 12:32:09,460 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 12:32:09,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-22 12:32:09,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755331215] [2024-11-22 12:32:09,461 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 12:32:09,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-22 12:32:09,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:32:09,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-22 12:32:09,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-11-22 12:32:09,462 INFO L87 Difference]: Start difference. First operand 486 states and 643 transitions. Second operand has 12 states, 10 states have (on average 9.9) internal successors, (99), 12 states have internal predecessors, (99), 6 states have call successors, (24), 4 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) [2024-11-22 12:32:09,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:32:09,899 INFO L93 Difference]: Finished difference Result 780 states and 1020 transitions. [2024-11-22 12:32:09,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-22 12:32:09,900 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 9.9) internal successors, (99), 12 states have internal predecessors, (99), 6 states have call successors, (24), 4 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) Word has length 110 [2024-11-22 12:32:09,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:32:09,902 INFO L225 Difference]: With dead ends: 780 [2024-11-22 12:32:09,902 INFO L226 Difference]: Without dead ends: 297 [2024-11-22 12:32:09,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 264 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2024-11-22 12:32:09,903 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 207 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 12:32:09,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 516 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 12:32:09,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2024-11-22 12:32:09,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 287. [2024-11-22 12:32:09,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 251 states have (on average 1.2310756972111554) internal successors, (309), 252 states have internal predecessors, (309), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-22 12:32:09,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 365 transitions. [2024-11-22 12:32:09,921 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 365 transitions. Word has length 110 [2024-11-22 12:32:09,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:32:09,921 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 365 transitions. [2024-11-22 12:32:09,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 9.9) internal successors, (99), 12 states have internal predecessors, (99), 6 states have call successors, (24), 4 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) [2024-11-22 12:32:09,922 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 365 transitions. [2024-11-22 12:32:09,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-22 12:32:09,922 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:32:09,922 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:32:09,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Forceful destruction successful, exit code 0 [2024-11-22 12:32:10,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-11-22 12:32:10,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:32:10,325 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:32:10,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:32:10,326 INFO L85 PathProgramCache]: Analyzing trace with hash -82928429, now seen corresponding path program 1 times [2024-11-22 12:32:10,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:32:10,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1377603269] [2024-11-22 12:32:10,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:32:10,327 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-22 12:32:10,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:32:10,328 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-22 12:32:10,329 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-22 12:32:10,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:32:10,526 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-22 12:32:10,528 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:32:10,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-22 12:32:11,027 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:32:11,027 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 39 treesize of output 19 [2024-11-22 12:32:11,066 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 143 proven. 15 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-11-22 12:32:11,066 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:32:11,472 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:32:11,473 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 45 treesize of output 25 [2024-11-22 12:32:11,690 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:32:11,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1377603269] [2024-11-22 12:32:11,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1377603269] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 12:32:11,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1128803893] [2024-11-22 12:32:11,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:32:11,691 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-22 12:32:11,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-22 12:32:11,695 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-22 12:32:11,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2024-11-22 12:32:12,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:32:12,287 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-22 12:32:12,290 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:32:12,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-22 12:32:12,559 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-22 12:32:13,449 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:32:13,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 23 [2024-11-22 12:32:13,511 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 149 proven. 15 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-22 12:32:13,511 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:32:13,878 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 28 treesize of output 20 [2024-11-22 12:32:14,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1128803893] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 12:32:14,137 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 12:32:14,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 19 [2024-11-22 12:32:14,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632207774] [2024-11-22 12:32:14,138 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 12:32:14,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-22 12:32:14,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:32:14,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-22 12:32:14,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=717, Unknown=0, NotChecked=0, Total=870 [2024-11-22 12:32:14,140 INFO L87 Difference]: Start difference. First operand 287 states and 365 transitions. Second operand has 20 states, 18 states have (on average 6.222222222222222) internal successors, (112), 18 states have internal predecessors, (112), 6 states have call successors, (24), 5 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24)