./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-22.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-22.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 f15b1832185bc6e5ed8ca3a7e02ddd56b37c4032577256d66dd546b8130db09b --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:28:25,706 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:28:25,802 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 01:28:25,807 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:28:25,809 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:28:25,839 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:28:25,840 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:28:25,840 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:28:25,841 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:28:25,842 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:28:25,843 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:28:25,843 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:28:25,844 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:28:25,844 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:28:25,844 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:28:25,845 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:28:25,845 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:28:25,845 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:28:25,846 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 01:28:25,846 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:28:25,846 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:28:25,850 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:28:25,851 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:28:25,851 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:28:25,851 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:28:25,852 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:28:25,852 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:28:25,852 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:28:25,853 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:28:25,853 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:28:25,853 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:28:25,853 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:28:25,854 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:28:25,854 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:28:25,854 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:28:25,854 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:28:25,855 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 01:28:25,855 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 01:28:25,855 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:28:25,855 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:28:25,856 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:28:25,857 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:28:25,857 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 -> f15b1832185bc6e5ed8ca3a7e02ddd56b37c4032577256d66dd546b8130db09b [2024-11-09 01:28:26,125 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:28:26,152 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:28:26,156 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:28:26,157 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:28:26,158 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:28:26,159 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-22.i [2024-11-09 01:28:27,600 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:28:27,795 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:28:27,796 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-22.i [2024-11-09 01:28:27,806 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39751c180/e6ef585b65544bdf9b8bce9104d96579/FLAGb90113cf9 [2024-11-09 01:28:28,160 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39751c180/e6ef585b65544bdf9b8bce9104d96579 [2024-11-09 01:28:28,163 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:28:28,164 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:28:28,165 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:28:28,166 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:28:28,172 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:28:28,173 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:28:28" (1/1) ... [2024-11-09 01:28:28,174 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@580417ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:28:28, skipping insertion in model container [2024-11-09 01:28:28,174 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:28:28" (1/1) ... [2024-11-09 01:28:28,200 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:28:28,357 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-22.i[916,929] [2024-11-09 01:28:28,412 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:28:28,424 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:28:28,435 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-22.i[916,929] [2024-11-09 01:28:28,476 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:28:28,504 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:28:28,508 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:28:28 WrapperNode [2024-11-09 01:28:28,509 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:28:28,510 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:28:28,510 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:28:28,510 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:28:28,518 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:28:28" (1/1) ... [2024-11-09 01:28:28,533 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:28:28" (1/1) ... [2024-11-09 01:28:28,571 INFO L138 Inliner]: procedures = 29, calls = 121, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 418 [2024-11-09 01:28:28,572 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:28:28,572 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:28:28,573 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:28:28,573 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:28:28,585 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:28:28" (1/1) ... [2024-11-09 01:28:28,586 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:28:28" (1/1) ... [2024-11-09 01:28:28,592 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:28:28" (1/1) ... [2024-11-09 01:28:28,617 INFO L175 MemorySlicer]: Split 96 memory accesses to 6 slices as follows [2, 8, 29, 8, 16, 33]. 34 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 4, 1, 2, 2]. The 14 writes are split as follows [0, 1, 4, 2, 4, 3]. [2024-11-09 01:28:28,618 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:28:28" (1/1) ... [2024-11-09 01:28:28,618 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:28:28" (1/1) ... [2024-11-09 01:28:28,646 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:28:28" (1/1) ... [2024-11-09 01:28:28,655 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:28:28" (1/1) ... [2024-11-09 01:28:28,662 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:28:28" (1/1) ... [2024-11-09 01:28:28,668 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:28:28" (1/1) ... [2024-11-09 01:28:28,678 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:28:28,682 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:28:28,682 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:28:28,682 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:28:28,683 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:28:28" (1/1) ... [2024-11-09 01:28:28,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:28:28,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:28:28,726 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 01:28:28,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 01:28:28,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:28:28,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-09 01:28:28,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-09 01:28:28,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-09 01:28:28,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-09 01:28:28,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-09 01:28:28,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-09 01:28:28,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 01:28:28,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 01:28:28,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 01:28:28,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-09 01:28:28,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-09 01:28:28,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-09 01:28:28,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-09 01:28:28,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-09 01:28:28,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-09 01:28:28,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-09 01:28:28,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-09 01:28:28,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-09 01:28:28,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 01:28:28,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 01:28:28,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 01:28:28,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-09 01:28:28,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-09 01:28:28,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-09 01:28:28,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-09 01:28:28,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-09 01:28:28,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-09 01:28:28,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-09 01:28:28,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-09 01:28:28,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-09 01:28:28,789 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:28:28,789 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:28:28,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 01:28:28,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 01:28:28,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 01:28:28,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-09 01:28:28,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-09 01:28:28,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-09 01:28:28,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:28:28,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:28:28,926 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:28:28,928 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:28:29,437 INFO L? ?]: Removed 110 outVars from TransFormulas that were not future-live. [2024-11-09 01:28:29,438 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:28:29,456 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:28:29,457 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:28:29,458 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:28:29 BoogieIcfgContainer [2024-11-09 01:28:29,458 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:28:29,462 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:28:29,462 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:28:29,465 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:28:29,466 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:28:28" (1/3) ... [2024-11-09 01:28:29,467 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@250b8b81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:28:29, skipping insertion in model container [2024-11-09 01:28:29,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:28:28" (2/3) ... [2024-11-09 01:28:29,467 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@250b8b81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:28:29, skipping insertion in model container [2024-11-09 01:28:29,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:28:29" (3/3) ... [2024-11-09 01:28:29,469 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-22.i [2024-11-09 01:28:29,482 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:28:29,482 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:28:29,540 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:28:29,548 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;@464eae21, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:28:29,548 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:28:29,553 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 93 states have (on average 1.4623655913978495) internal successors, (136), 94 states have internal predecessors, (136), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 01:28:29,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-09 01:28:29,566 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:28:29,567 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:28:29,567 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:28:29,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:28:29,574 INFO L85 PathProgramCache]: Analyzing trace with hash 70378630, now seen corresponding path program 1 times [2024-11-09 01:28:29,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:28:29,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832245967] [2024-11-09 01:28:29,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:29,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:28:29,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:29,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:28:29,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:29,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:28:29,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:29,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:28:29,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:29,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:28:29,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:29,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:28:29,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:29,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:28:29,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:29,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:28:29,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:29,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:28:29,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:30,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:28:30,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:30,011 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 01:28:30,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:28:30,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832245967] [2024-11-09 01:28:30,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832245967] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:28:30,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:28:30,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:28:30,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978209020] [2024-11-09 01:28:30,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:28:30,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:28:30,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:28:30,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:28:30,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:28:30,059 INFO L87 Difference]: Start difference. First operand has 105 states, 93 states have (on average 1.4623655913978495) internal successors, (136), 94 states have internal predecessors, (136), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-09 01:28:30,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:28:30,101 INFO L93 Difference]: Finished difference Result 203 states and 311 transitions. [2024-11-09 01:28:30,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:28:30,104 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 90 [2024-11-09 01:28:30,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:28:30,112 INFO L225 Difference]: With dead ends: 203 [2024-11-09 01:28:30,113 INFO L226 Difference]: Without dead ends: 101 [2024-11-09 01:28:30,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:28:30,123 INFO L432 NwaCegarLoop]: 146 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, 146 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:28:30,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:28:30,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-09 01:28:30,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-09 01:28:30,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 90 states have (on average 1.4222222222222223) internal successors, (128), 90 states have internal predecessors, (128), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 01:28:30,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 146 transitions. [2024-11-09 01:28:30,172 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 146 transitions. Word has length 90 [2024-11-09 01:28:30,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:28:30,173 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 146 transitions. [2024-11-09 01:28:30,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-09 01:28:30,173 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 146 transitions. [2024-11-09 01:28:30,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-09 01:28:30,180 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:28:30,180 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:28:30,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 01:28:30,181 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:28:30,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:28:30,182 INFO L85 PathProgramCache]: Analyzing trace with hash -286087808, now seen corresponding path program 1 times [2024-11-09 01:28:30,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:28:30,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713228684] [2024-11-09 01:28:30,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:30,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:28:30,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:30,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:28:30,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:30,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:28:30,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:30,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:28:30,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:30,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:28:30,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:30,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:28:30,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:30,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:28:30,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:30,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:28:30,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:30,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:28:30,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:30,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:28:30,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:30,508 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 01:28:30,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:28:30,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713228684] [2024-11-09 01:28:30,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713228684] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:28:30,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:28:30,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:28:30,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575458260] [2024-11-09 01:28:30,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:28:30,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:28:30,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:28:30,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:28:30,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:28:30,516 INFO L87 Difference]: Start difference. First operand 101 states and 146 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-09 01:28:30,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:28:30,568 INFO L93 Difference]: Finished difference Result 201 states and 292 transitions. [2024-11-09 01:28:30,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:28:30,569 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 90 [2024-11-09 01:28:30,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:28:30,571 INFO L225 Difference]: With dead ends: 201 [2024-11-09 01:28:30,571 INFO L226 Difference]: Without dead ends: 103 [2024-11-09 01:28:30,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:28:30,575 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 421 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-09 01:28:30,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 421 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:28:30,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-09 01:28:30,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-09 01:28:30,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 92 states have (on average 1.4130434782608696) internal successors, (130), 92 states have internal predecessors, (130), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 01:28:30,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 148 transitions. [2024-11-09 01:28:30,589 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 148 transitions. Word has length 90 [2024-11-09 01:28:30,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:28:30,590 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 148 transitions. [2024-11-09 01:28:30,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-09 01:28:30,591 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 148 transitions. [2024-11-09 01:28:30,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-09 01:28:30,595 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:28:30,595 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:28:30,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 01:28:30,596 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:28:30,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:28:30,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1624954750, now seen corresponding path program 1 times [2024-11-09 01:28:30,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:28:30,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591762521] [2024-11-09 01:28:30,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:30,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:28:30,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:31,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:28:31,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:31,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:28:31,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:31,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:28:31,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:31,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:28:31,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:31,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:28:31,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:31,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:28:31,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:31,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:28:31,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:31,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:28:31,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:31,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:28:31,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:31,388 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 01:28:31,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:28:31,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591762521] [2024-11-09 01:28:31,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591762521] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:28:31,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:28:31,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 01:28:31,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161107848] [2024-11-09 01:28:31,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:28:31,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 01:28:31,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:28:31,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 01:28:31,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:28:31,392 INFO L87 Difference]: Start difference. First operand 103 states and 148 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 01:28:32,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:28:32,390 INFO L93 Difference]: Finished difference Result 535 states and 770 transitions. [2024-11-09 01:28:32,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 01:28:32,390 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 90 [2024-11-09 01:28:32,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:28:32,394 INFO L225 Difference]: With dead ends: 535 [2024-11-09 01:28:32,395 INFO L226 Difference]: Without dead ends: 435 [2024-11-09 01:28:32,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-11-09 01:28:32,397 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 582 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 582 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 01:28:32,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [582 Valid, 951 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 01:28:32,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2024-11-09 01:28:32,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 288. [2024-11-09 01:28:32,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 257 states have (on average 1.4085603112840468) internal successors, (362), 257 states have internal predecessors, (362), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-09 01:28:32,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 416 transitions. [2024-11-09 01:28:32,447 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 416 transitions. Word has length 90 [2024-11-09 01:28:32,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:28:32,448 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 416 transitions. [2024-11-09 01:28:32,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 01:28:32,448 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 416 transitions. [2024-11-09 01:28:32,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-09 01:28:32,450 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:28:32,450 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:28:32,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 01:28:32,451 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:28:32,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:28:32,451 INFO L85 PathProgramCache]: Analyzing trace with hash -701013642, now seen corresponding path program 1 times [2024-11-09 01:28:32,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:28:32,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068198372] [2024-11-09 01:28:32,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:32,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:28:32,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:32,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:28:32,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:32,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:28:32,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:32,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:28:32,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:32,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:28:32,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:32,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:28:32,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:32,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:28:32,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:32,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:28:32,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:32,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:28:32,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:32,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:28:32,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:32,599 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 01:28:32,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:28:32,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068198372] [2024-11-09 01:28:32,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068198372] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:28:32,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:28:32,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:28:32,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163049603] [2024-11-09 01:28:32,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:28:32,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:28:32,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:28:32,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:28:32,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:28:32,602 INFO L87 Difference]: Start difference. First operand 288 states and 416 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 01:28:32,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:28:32,640 INFO L93 Difference]: Finished difference Result 591 states and 857 transitions. [2024-11-09 01:28:32,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:28:32,641 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 91 [2024-11-09 01:28:32,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:28:32,643 INFO L225 Difference]: With dead ends: 591 [2024-11-09 01:28:32,643 INFO L226 Difference]: Without dead ends: 306 [2024-11-09 01:28:32,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:28:32,649 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 28 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 282 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-09 01:28:32,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 282 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:28:32,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-11-09 01:28:32,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 204. [2024-11-09 01:28:32,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 183 states have (on average 1.3989071038251366) internal successors, (256), 183 states have internal predecessors, (256), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 01:28:32,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 292 transitions. [2024-11-09 01:28:32,680 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 292 transitions. Word has length 91 [2024-11-09 01:28:32,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:28:32,681 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 292 transitions. [2024-11-09 01:28:32,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 01:28:32,681 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 292 transitions. [2024-11-09 01:28:32,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-09 01:28:32,682 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:28:32,682 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:28:32,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 01:28:32,683 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:28:32,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:28:32,683 INFO L85 PathProgramCache]: Analyzing trace with hash 82762177, now seen corresponding path program 1 times [2024-11-09 01:28:32,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:28:32,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122832456] [2024-11-09 01:28:32,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:32,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:28:32,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:32,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:28:32,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:32,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:28:32,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:32,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:28:32,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:32,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:28:32,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:32,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:28:32,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:32,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:28:32,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:32,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:28:32,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:32,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:28:32,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:32,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:28:32,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:32,774 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 01:28:32,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:28:32,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122832456] [2024-11-09 01:28:32,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122832456] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:28:32,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:28:32,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:28:32,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363169742] [2024-11-09 01:28:32,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:28:32,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:28:32,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:28:32,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:28:32,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:28:32,777 INFO L87 Difference]: Start difference. First operand 204 states and 292 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 01:28:32,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:28:32,835 INFO L93 Difference]: Finished difference Result 366 states and 523 transitions. [2024-11-09 01:28:32,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:28:32,836 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 92 [2024-11-09 01:28:32,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:28:32,837 INFO L225 Difference]: With dead ends: 366 [2024-11-09 01:28:32,837 INFO L226 Difference]: Without dead ends: 165 [2024-11-09 01:28:32,838 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:28:32,839 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:28:32,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 248 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:28:32,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-09 01:28:32,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 151. [2024-11-09 01:28:32,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 130 states have (on average 1.3615384615384616) internal successors, (177), 130 states have internal predecessors, (177), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 01:28:32,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 213 transitions. [2024-11-09 01:28:32,851 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 213 transitions. Word has length 92 [2024-11-09 01:28:32,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:28:32,852 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 213 transitions. [2024-11-09 01:28:32,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 01:28:32,852 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 213 transitions. [2024-11-09 01:28:32,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-09 01:28:32,853 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:28:32,853 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:28:32,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 01:28:32,854 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:28:32,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:28:32,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1959301337, now seen corresponding path program 1 times [2024-11-09 01:28:32,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:28:32,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680849639] [2024-11-09 01:28:32,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:32,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:28:33,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:33,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:28:33,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:33,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:28:33,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:33,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:28:33,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:33,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:28:33,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:33,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:28:33,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:33,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:28:33,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:33,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:28:33,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:33,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:28:33,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:33,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:28:33,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:33,620 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-09 01:28:33,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:28:33,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680849639] [2024-11-09 01:28:33,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680849639] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:28:33,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239812724] [2024-11-09 01:28:33,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:33,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:28:33,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:28:33,624 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-09 01:28:33,625 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-09 01:28:33,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:33,818 INFO L255 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-09 01:28:33,828 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:28:34,322 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 11 [2024-11-09 01:28:34,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2024-11-09 01:28:34,481 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-09 01:28:34,481 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:28:34,970 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 01:28:34,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1239812724] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 01:28:34,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-09 01:28:34,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10, 9] total 20 [2024-11-09 01:28:34,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485481132] [2024-11-09 01:28:34,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:28:34,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:28:34,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:28:34,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:28:34,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2024-11-09 01:28:34,972 INFO L87 Difference]: Start difference. First operand 151 states and 213 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 01:28:35,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:28:35,189 INFO L93 Difference]: Finished difference Result 351 states and 496 transitions. [2024-11-09 01:28:35,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:28:35,190 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 95 [2024-11-09 01:28:35,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:28:35,193 INFO L225 Difference]: With dead ends: 351 [2024-11-09 01:28:35,193 INFO L226 Difference]: Without dead ends: 252 [2024-11-09 01:28:35,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2024-11-09 01:28:35,196 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 121 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:28:35,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 741 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:28:35,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-11-09 01:28:35,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 171. [2024-11-09 01:28:35,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 150 states have (on average 1.36) internal successors, (204), 150 states have internal predecessors, (204), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 01:28:35,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 240 transitions. [2024-11-09 01:28:35,216 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 240 transitions. Word has length 95 [2024-11-09 01:28:35,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:28:35,217 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 240 transitions. [2024-11-09 01:28:35,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 01:28:35,217 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 240 transitions. [2024-11-09 01:28:35,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-09 01:28:35,219 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:28:35,220 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:28:35,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 01:28:35,420 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,SelfDestructingSolverStorable5 [2024-11-09 01:28:35,421 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:28:35,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:28:35,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1870385077, now seen corresponding path program 1 times [2024-11-09 01:28:35,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:28:35,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029328095] [2024-11-09 01:28:35,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:35,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:28:35,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:35,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:28:35,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:35,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:28:35,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:35,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:28:35,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:35,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:28:35,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:35,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:28:35,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:35,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:28:35,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:35,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:28:35,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:35,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:28:35,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:35,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:28:35,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:35,987 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 01:28:35,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:28:35,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029328095] [2024-11-09 01:28:35,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029328095] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:28:35,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:28:35,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:28:35,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045720051] [2024-11-09 01:28:35,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:28:35,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:28:35,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:28:35,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:28:35,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:28:35,990 INFO L87 Difference]: Start difference. First operand 171 states and 240 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 01:28:36,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:28:36,189 INFO L93 Difference]: Finished difference Result 388 states and 549 transitions. [2024-11-09 01:28:36,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:28:36,190 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2024-11-09 01:28:36,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:28:36,192 INFO L225 Difference]: With dead ends: 388 [2024-11-09 01:28:36,192 INFO L226 Difference]: Without dead ends: 268 [2024-11-09 01:28:36,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:28:36,194 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 209 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:28:36,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 573 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:28:36,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-11-09 01:28:36,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 266. [2024-11-09 01:28:36,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 235 states have (on average 1.3702127659574468) internal successors, (322), 235 states have internal predecessors, (322), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-09 01:28:36,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 376 transitions. [2024-11-09 01:28:36,211 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 376 transitions. Word has length 96 [2024-11-09 01:28:36,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:28:36,212 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 376 transitions. [2024-11-09 01:28:36,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 01:28:36,212 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 376 transitions. [2024-11-09 01:28:36,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-09 01:28:36,214 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:28:36,215 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:28:36,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 01:28:36,215 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:28:36,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:28:36,216 INFO L85 PathProgramCache]: Analyzing trace with hash -994815262, now seen corresponding path program 1 times [2024-11-09 01:28:36,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:28:36,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887106632] [2024-11-09 01:28:36,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:36,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:28:36,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:36,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:28:36,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:36,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:28:36,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:36,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:28:36,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:36,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:28:36,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:36,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:28:36,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:36,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:28:36,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:36,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:28:36,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:36,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:28:36,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:36,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:28:36,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:36,964 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 01:28:36,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:28:36,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887106632] [2024-11-09 01:28:36,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887106632] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:28:36,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:28:36,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 01:28:36,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172127146] [2024-11-09 01:28:36,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:28:36,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 01:28:36,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:28:36,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 01:28:36,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:28:36,967 INFO L87 Difference]: Start difference. First operand 266 states and 376 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 01:28:37,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:28:37,266 INFO L93 Difference]: Finished difference Result 440 states and 620 transitions. [2024-11-09 01:28:37,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 01:28:37,266 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 97 [2024-11-09 01:28:37,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:28:37,269 INFO L225 Difference]: With dead ends: 440 [2024-11-09 01:28:37,269 INFO L226 Difference]: Without dead ends: 324 [2024-11-09 01:28:37,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-09 01:28:37,270 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 264 mSDsluCounter, 784 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:28:37,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 968 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:28:37,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2024-11-09 01:28:37,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 291. [2024-11-09 01:28:37,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 260 states have (on average 1.373076923076923) internal successors, (357), 260 states have internal predecessors, (357), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-09 01:28:37,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 411 transitions. [2024-11-09 01:28:37,289 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 411 transitions. Word has length 97 [2024-11-09 01:28:37,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:28:37,290 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 411 transitions. [2024-11-09 01:28:37,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 01:28:37,291 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 411 transitions. [2024-11-09 01:28:37,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-09 01:28:37,292 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:28:37,292 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:28:37,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 01:28:37,292 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:28:37,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:28:37,293 INFO L85 PathProgramCache]: Analyzing trace with hash -102155987, now seen corresponding path program 1 times [2024-11-09 01:28:37,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:28:37,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912730762] [2024-11-09 01:28:37,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:37,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:28:37,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:37,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:28:37,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:37,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:28:37,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:37,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:28:37,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:37,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:28:37,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:37,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:28:37,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:37,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:28:37,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:37,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:28:37,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:37,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:28:37,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:37,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:28:37,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:37,771 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 01:28:37,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:28:37,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912730762] [2024-11-09 01:28:37,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912730762] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:28:37,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:28:37,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 01:28:37,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547037237] [2024-11-09 01:28:37,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:28:37,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 01:28:37,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:28:37,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 01:28:37,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:28:37,774 INFO L87 Difference]: Start difference. First operand 291 states and 411 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 01:28:38,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:28:38,029 INFO L93 Difference]: Finished difference Result 489 states and 688 transitions. [2024-11-09 01:28:38,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:28:38,029 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 97 [2024-11-09 01:28:38,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:28:38,032 INFO L225 Difference]: With dead ends: 489 [2024-11-09 01:28:38,032 INFO L226 Difference]: Without dead ends: 365 [2024-11-09 01:28:38,035 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:28:38,036 INFO L432 NwaCegarLoop]: 273 mSDtfsCounter, 322 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:28:38,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 867 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:28:38,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2024-11-09 01:28:38,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 287. [2024-11-09 01:28:38,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 256 states have (on average 1.3671875) internal successors, (350), 256 states have internal predecessors, (350), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-09 01:28:38,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 404 transitions. [2024-11-09 01:28:38,054 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 404 transitions. Word has length 97 [2024-11-09 01:28:38,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:28:38,055 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 404 transitions. [2024-11-09 01:28:38,055 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 01:28:38,055 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 404 transitions. [2024-11-09 01:28:38,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-09 01:28:38,056 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:28:38,056 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:28:38,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 01:28:38,057 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:28:38,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:28:38,057 INFO L85 PathProgramCache]: Analyzing trace with hash -266012127, now seen corresponding path program 1 times [2024-11-09 01:28:38,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:28:38,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921444544] [2024-11-09 01:28:38,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:38,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:28:38,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:38,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:28:38,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:38,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:28:38,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:38,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:28:38,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:38,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:28:38,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:38,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:28:38,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:38,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:28:38,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:38,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:28:38,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:38,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:28:38,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:38,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:28:38,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:38,409 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 01:28:38,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:28:38,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921444544] [2024-11-09 01:28:38,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921444544] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:28:38,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:28:38,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 01:28:38,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177132633] [2024-11-09 01:28:38,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:28:38,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 01:28:38,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:28:38,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 01:28:38,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:28:38,411 INFO L87 Difference]: Start difference. First operand 287 states and 404 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 01:28:38,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:28:38,870 INFO L93 Difference]: Finished difference Result 782 states and 1108 transitions. [2024-11-09 01:28:38,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 01:28:38,871 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 97 [2024-11-09 01:28:38,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:28:38,874 INFO L225 Difference]: With dead ends: 782 [2024-11-09 01:28:38,874 INFO L226 Difference]: Without dead ends: 546 [2024-11-09 01:28:38,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-11-09 01:28:38,875 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 243 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 01:28:38,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 671 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 01:28:38,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2024-11-09 01:28:38,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 302. [2024-11-09 01:28:38,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 271 states have (on average 1.3579335793357934) internal successors, (368), 271 states have internal predecessors, (368), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-09 01:28:38,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 422 transitions. [2024-11-09 01:28:38,894 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 422 transitions. Word has length 97 [2024-11-09 01:28:38,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:28:38,894 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 422 transitions. [2024-11-09 01:28:38,894 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 01:28:38,894 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 422 transitions. [2024-11-09 01:28:38,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-09 01:28:38,895 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:28:38,895 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:28:38,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 01:28:38,896 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:28:38,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:28:38,897 INFO L85 PathProgramCache]: Analyzing trace with hash -203972513, now seen corresponding path program 1 times [2024-11-09 01:28:38,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:28:38,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712871109] [2024-11-09 01:28:38,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:38,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:28:38,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:39,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:28:39,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:39,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:28:39,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:39,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:28:39,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:39,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:28:39,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:39,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:28:39,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:39,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:28:39,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:39,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:28:39,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:39,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:28:39,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:39,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:28:39,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:39,644 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 01:28:39,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:28:39,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712871109] [2024-11-09 01:28:39,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712871109] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:28:39,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:28:39,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 01:28:39,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557110307] [2024-11-09 01:28:39,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:28:39,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 01:28:39,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:28:39,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 01:28:39,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:28:39,646 INFO L87 Difference]: Start difference. First operand 302 states and 422 transitions. Second operand has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-09 01:28:40,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:28:40,328 INFO L93 Difference]: Finished difference Result 887 states and 1251 transitions. [2024-11-09 01:28:40,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 01:28:40,329 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 97 [2024-11-09 01:28:40,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:28:40,332 INFO L225 Difference]: With dead ends: 887 [2024-11-09 01:28:40,332 INFO L226 Difference]: Without dead ends: 651 [2024-11-09 01:28:40,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2024-11-09 01:28:40,333 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 399 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:28:40,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 820 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 01:28:40,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2024-11-09 01:28:40,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 318. [2024-11-09 01:28:40,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 287 states have (on average 1.3554006968641115) internal successors, (389), 287 states have internal predecessors, (389), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-09 01:28:40,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 443 transitions. [2024-11-09 01:28:40,354 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 443 transitions. Word has length 97 [2024-11-09 01:28:40,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:28:40,355 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 443 transitions. [2024-11-09 01:28:40,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-09 01:28:40,355 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 443 transitions. [2024-11-09 01:28:40,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-09 01:28:40,356 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:28:40,356 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:28:40,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 01:28:40,356 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:28:40,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:28:40,357 INFO L85 PathProgramCache]: Analyzing trace with hash 2096850077, now seen corresponding path program 1 times [2024-11-09 01:28:40,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:28:40,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103069903] [2024-11-09 01:28:40,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:40,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:28:40,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:40,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:28:40,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:40,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:28:40,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:40,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:28:40,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:40,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:28:40,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:40,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:28:40,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:40,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:28:40,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:40,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:28:40,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:40,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:28:40,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:40,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:28:40,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:40,736 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 01:28:40,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:28:40,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103069903] [2024-11-09 01:28:40,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103069903] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:28:40,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:28:40,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:28:40,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246373622] [2024-11-09 01:28:40,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:28:40,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:28:40,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:28:40,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:28:40,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:28:40,739 INFO L87 Difference]: Start difference. First operand 318 states and 443 transitions. Second operand has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-09 01:28:40,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:28:40,797 INFO L93 Difference]: Finished difference Result 506 states and 710 transitions. [2024-11-09 01:28:40,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:28:40,797 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 97 [2024-11-09 01:28:40,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:28:40,800 INFO L225 Difference]: With dead ends: 506 [2024-11-09 01:28:40,800 INFO L226 Difference]: Without dead ends: 383 [2024-11-09 01:28:40,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:28:40,801 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 156 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:28:40,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 626 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:28:40,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2024-11-09 01:28:40,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 314. [2024-11-09 01:28:40,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 283 states have (on average 1.3498233215547704) internal successors, (382), 283 states have internal predecessors, (382), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-09 01:28:40,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 436 transitions. [2024-11-09 01:28:40,817 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 436 transitions. Word has length 97 [2024-11-09 01:28:40,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:28:40,819 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 436 transitions. [2024-11-09 01:28:40,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-09 01:28:40,819 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 436 transitions. [2024-11-09 01:28:40,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-09 01:28:40,820 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:28:40,820 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:28:40,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 01:28:40,821 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:28:40,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:28:40,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1979262501, now seen corresponding path program 1 times [2024-11-09 01:28:40,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:28:40,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13830977] [2024-11-09 01:28:40,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:40,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:28:40,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:41,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:28:41,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:41,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:28:41,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:41,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:28:41,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:41,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:28:41,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:41,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:28:41,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:41,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:28:41,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:41,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:28:41,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:41,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:28:41,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:41,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:28:41,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:41,543 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 01:28:41,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:28:41,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13830977] [2024-11-09 01:28:41,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13830977] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:28:41,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:28:41,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 01:28:41,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46138603] [2024-11-09 01:28:41,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:28:41,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 01:28:41,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:28:41,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 01:28:41,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:28:41,546 INFO L87 Difference]: Start difference. First operand 314 states and 436 transitions. Second operand has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-09 01:28:42,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:28:42,307 INFO L93 Difference]: Finished difference Result 700 states and 978 transitions. [2024-11-09 01:28:42,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 01:28:42,308 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 97 [2024-11-09 01:28:42,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:28:42,310 INFO L225 Difference]: With dead ends: 700 [2024-11-09 01:28:42,310 INFO L226 Difference]: Without dead ends: 457 [2024-11-09 01:28:42,311 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2024-11-09 01:28:42,312 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 245 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 01:28:42,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 839 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 01:28:42,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2024-11-09 01:28:42,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 310. [2024-11-09 01:28:42,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 279 states have (on average 1.3476702508960574) internal successors, (376), 279 states have internal predecessors, (376), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-09 01:28:42,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 430 transitions. [2024-11-09 01:28:42,329 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 430 transitions. Word has length 97 [2024-11-09 01:28:42,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:28:42,330 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 430 transitions. [2024-11-09 01:28:42,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-09 01:28:42,330 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 430 transitions. [2024-11-09 01:28:42,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-09 01:28:42,331 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:28:42,331 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:28:42,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 01:28:42,332 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:28:42,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:28:42,332 INFO L85 PathProgramCache]: Analyzing trace with hash -943007405, now seen corresponding path program 1 times [2024-11-09 01:28:42,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:28:42,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080978825] [2024-11-09 01:28:42,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:42,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:28:42,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:42,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:28:42,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:42,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:28:42,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:42,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:28:42,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:42,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:28:42,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:42,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:28:42,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:42,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:28:42,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:42,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:28:42,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:42,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:28:42,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:42,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:28:42,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:42,538 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 01:28:42,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:28:42,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080978825] [2024-11-09 01:28:42,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080978825] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:28:42,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:28:42,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:28:42,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394726881] [2024-11-09 01:28:42,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:28:42,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:28:42,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:28:42,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:28:42,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:28:42,543 INFO L87 Difference]: Start difference. First operand 310 states and 430 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 01:28:42,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:28:42,559 INFO L93 Difference]: Finished difference Result 430 states and 597 transitions. [2024-11-09 01:28:42,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:28:42,559 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 98 [2024-11-09 01:28:42,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:28:42,561 INFO L225 Difference]: With dead ends: 430 [2024-11-09 01:28:42,561 INFO L226 Difference]: Without dead ends: 184 [2024-11-09 01:28:42,561 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:28:42,562 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:28:42,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 273 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:28:42,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-09 01:28:42,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 182. [2024-11-09 01:28:42,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 161 states have (on average 1.3043478260869565) internal successors, (210), 161 states have internal predecessors, (210), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 01:28:42,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 246 transitions. [2024-11-09 01:28:42,575 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 246 transitions. Word has length 98 [2024-11-09 01:28:42,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:28:42,575 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 246 transitions. [2024-11-09 01:28:42,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 01:28:42,576 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 246 transitions. [2024-11-09 01:28:42,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-09 01:28:42,577 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:28:42,578 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:28:42,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 01:28:42,578 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:28:42,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:28:42,578 INFO L85 PathProgramCache]: Analyzing trace with hash 79469469, now seen corresponding path program 1 times [2024-11-09 01:28:42,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:28:42,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702282346] [2024-11-09 01:28:42,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:42,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:28:42,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:42,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:28:42,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:42,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:28:42,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:42,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:28:42,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:42,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:28:42,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:43,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:28:43,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:43,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:28:43,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:43,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:28:43,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:43,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:28:43,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:43,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:28:43,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:43,058 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-09 01:28:43,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:28:43,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702282346] [2024-11-09 01:28:43,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702282346] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:28:43,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757853846] [2024-11-09 01:28:43,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:43,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:28:43,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:28:43,060 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-09 01:28:43,062 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-09 01:28:43,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:43,455 INFO L255 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 01:28:43,462 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:28:43,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-09 01:28:43,954 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 16 [2024-11-09 01:28:44,002 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 83 proven. 12 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-09 01:28:44,002 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:28:45,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 44 [2024-11-09 01:28:45,443 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 33 proven. 12 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-11-09 01:28:45,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1757853846] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:28:45,444 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:28:45,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 14] total 30 [2024-11-09 01:28:45,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827417812] [2024-11-09 01:28:45,444 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 01:28:45,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-09 01:28:45,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:28:45,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-09 01:28:45,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=685, Unknown=0, NotChecked=0, Total=870 [2024-11-09 01:28:45,446 INFO L87 Difference]: Start difference. First operand 182 states and 246 transitions. Second operand has 30 states, 26 states have (on average 4.961538461538462) internal successors, (129), 29 states have internal predecessors, (129), 9 states have call successors, (27), 4 states have call predecessors, (27), 8 states have return successors, (27), 6 states have call predecessors, (27), 9 states have call successors, (27) [2024-11-09 01:28:46,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:28:46,899 INFO L93 Difference]: Finished difference Result 409 states and 554 transitions. [2024-11-09 01:28:46,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-09 01:28:46,904 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 26 states have (on average 4.961538461538462) internal successors, (129), 29 states have internal predecessors, (129), 9 states have call successors, (27), 4 states have call predecessors, (27), 8 states have return successors, (27), 6 states have call predecessors, (27), 9 states have call successors, (27) Word has length 99 [2024-11-09 01:28:46,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:28:46,909 INFO L225 Difference]: With dead ends: 409 [2024-11-09 01:28:46,909 INFO L226 Difference]: Without dead ends: 298 [2024-11-09 01:28:46,912 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 195 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 534 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=539, Invalid=1813, Unknown=0, NotChecked=0, Total=2352 [2024-11-09 01:28:46,915 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 420 mSDsluCounter, 1536 mSDsCounter, 0 mSdLazyCounter, 1058 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 1629 SdHoareTripleChecker+Invalid, 1113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:28:46,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 1629 Invalid, 1113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1058 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 01:28:46,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-11-09 01:28:46,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 196. [2024-11-09 01:28:46,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 173 states have (on average 1.2890173410404624) internal successors, (223), 173 states have internal predecessors, (223), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 01:28:46,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 259 transitions. [2024-11-09 01:28:46,935 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 259 transitions. Word has length 99 [2024-11-09 01:28:46,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:28:46,935 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 259 transitions. [2024-11-09 01:28:46,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 26 states have (on average 4.961538461538462) internal successors, (129), 29 states have internal predecessors, (129), 9 states have call successors, (27), 4 states have call predecessors, (27), 8 states have return successors, (27), 6 states have call predecessors, (27), 9 states have call successors, (27) [2024-11-09 01:28:46,936 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 259 transitions. [2024-11-09 01:28:46,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-09 01:28:46,937 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:28:46,937 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:28:46,955 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-09 01:28:47,141 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,SelfDestructingSolverStorable14 [2024-11-09 01:28:47,142 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:28:47,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:28:47,143 INFO L85 PathProgramCache]: Analyzing trace with hash -538798334, now seen corresponding path program 1 times [2024-11-09 01:28:47,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:28:47,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910256961] [2024-11-09 01:28:47,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:47,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:28:47,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:28:47,214 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 01:28:47,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:28:47,346 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 01:28:47,346 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 01:28:47,347 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 01:28:47,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 01:28:47,352 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:28:47,451 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 01:28:47,455 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 01:28:47 BoogieIcfgContainer [2024-11-09 01:28:47,455 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 01:28:47,455 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 01:28:47,456 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 01:28:47,456 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 01:28:47,456 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:28:29" (3/4) ... [2024-11-09 01:28:47,459 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 01:28:47,460 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 01:28:47,460 INFO L158 Benchmark]: Toolchain (without parser) took 19296.31ms. Allocated memory was 159.4MB in the beginning and 461.4MB in the end (delta: 302.0MB). Free memory was 109.6MB in the beginning and 408.0MB in the end (delta: -298.4MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. [2024-11-09 01:28:47,461 INFO L158 Benchmark]: CDTParser took 0.63ms. Allocated memory is still 159.4MB. Free memory is still 119.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:28:47,461 INFO L158 Benchmark]: CACSL2BoogieTranslator took 343.82ms. Allocated memory is still 159.4MB. Free memory was 109.0MB in the beginning and 92.8MB in the end (delta: 16.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 01:28:47,462 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.88ms. Allocated memory is still 159.4MB. Free memory was 92.8MB in the beginning and 89.2MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 01:28:47,462 INFO L158 Benchmark]: Boogie Preprocessor took 108.75ms. Allocated memory is still 159.4MB. Free memory was 89.2MB in the beginning and 84.5MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 01:28:47,463 INFO L158 Benchmark]: RCFGBuilder took 776.15ms. Allocated memory is still 159.4MB. Free memory was 84.4MB in the beginning and 111.3MB in the end (delta: -27.0MB). Peak memory consumption was 27.5MB. Max. memory is 16.1GB. [2024-11-09 01:28:47,463 INFO L158 Benchmark]: TraceAbstraction took 17993.27ms. Allocated memory was 159.4MB in the beginning and 461.4MB in the end (delta: 302.0MB). Free memory was 110.5MB in the beginning and 408.0MB in the end (delta: -297.5MB). Peak memory consumption was 260.1MB. Max. memory is 16.1GB. [2024-11-09 01:28:47,463 INFO L158 Benchmark]: Witness Printer took 4.50ms. Allocated memory is still 461.4MB. Free memory is still 408.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:28:47,469 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.63ms. Allocated memory is still 159.4MB. Free memory is still 119.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 343.82ms. Allocated memory is still 159.4MB. Free memory was 109.0MB in the beginning and 92.8MB in the end (delta: 16.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.88ms. Allocated memory is still 159.4MB. Free memory was 92.8MB in the beginning and 89.2MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 108.75ms. Allocated memory is still 159.4MB. Free memory was 89.2MB in the beginning and 84.5MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 776.15ms. Allocated memory is still 159.4MB. Free memory was 84.4MB in the beginning and 111.3MB in the end (delta: -27.0MB). Peak memory consumption was 27.5MB. Max. memory is 16.1GB. * TraceAbstraction took 17993.27ms. Allocated memory was 159.4MB in the beginning and 461.4MB in the end (delta: 302.0MB). Free memory was 110.5MB in the beginning and 408.0MB in the end (delta: -297.5MB). Peak memory consumption was 260.1MB. Max. memory is 16.1GB. * Witness Printer took 4.50ms. Allocated memory is still 461.4MB. Free memory is still 408.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 92, overapproximation of bitwiseAnd at line 57, overapproximation of someBinaryArithmeticFLOAToperation at line 67. 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[2][2] = { {64.2, 128.75}, {7.6, 5.9} }; [L25-L27] float float_Array_0[2][2] = { {64.2, 128.75}, {7.6, 5.9} }; [L25-L27] float float_Array_0[2][2] = { {64.2, 128.75}, {7.6, 5.9} }; [L25-L27] float float_Array_0[2][2] = { {64.2, 128.75}, {7.6, 5.9} }; [L25-L27] float float_Array_0[2][2] = { {64.2, 128.75}, {7.6, 5.9} }; [L28-L30] signed short int signed_short_int_Array_0[1] = { -5 }; [L28-L30] signed short int signed_short_int_Array_0[1] = { -5 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[2] = { 3135928546, 8 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[2] = { 3135928546, 8 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[2] = { 3135928546, 8 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2] = { 44772, 256 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2] = { 44772, 256 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2] = { 44772, 256 }; [L37] signed short int last_1_signed_short_int_Array_0_0_ = -5; [L38] unsigned long int last_1_unsigned_long_int_Array_0_1_ = 8; VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=0, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L96] isInitial = 1 [L97] FCALL initially() [L98] COND TRUE 1 [L99] CALL updateLastVariables() [L88] EXPR signed_short_int_Array_0[0] [L88] last_1_signed_short_int_Array_0_0_ = signed_short_int_Array_0[0] [L89] EXPR unsigned_long_int_Array_0[1] [L89] last_1_unsigned_long_int_Array_0_1_ = unsigned_long_int_Array_0[1] [L99] RET updateLastVariables() [L100] CALL updateVariables() [L71] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L72] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_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_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L73] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L73] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_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_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L73] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L74] float_Array_0[0][0] = __VERIFIER_nondet_float() [L75] EXPR float_Array_0[0][0] [L75] EXPR float_Array_0[0][0] >= -230584.3009213691390e+13F && float_Array_0[0][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] EXPR float_Array_0[0][0] >= -230584.3009213691390e+13F && float_Array_0[0][0] <= -1.0e-20F [L75] EXPR float_Array_0[0][0] [L75] EXPR float_Array_0[0][0] >= -230584.3009213691390e+13F && float_Array_0[0][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] EXPR (float_Array_0[0][0] >= -230584.3009213691390e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 2305843.009213691390e+12F && float_Array_0[0][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] EXPR (float_Array_0[0][0] >= -230584.3009213691390e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 2305843.009213691390e+12F && float_Array_0[0][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] CALL assume_abort_if_not((float_Array_0[0][0] >= -230584.3009213691390e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 2305843.009213691390e+12F && float_Array_0[0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_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_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] RET assume_abort_if_not((float_Array_0[0][0] >= -230584.3009213691390e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 2305843.009213691390e+12F && float_Array_0[0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L76] float_Array_0[1][0] = __VERIFIER_nondet_float() [L77] EXPR float_Array_0[1][0] [L77] EXPR float_Array_0[1][0] >= -115292.1504606845700e+13F && float_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] EXPR float_Array_0[1][0] >= -115292.1504606845700e+13F && float_Array_0[1][0] <= -1.0e-20F [L77] EXPR float_Array_0[1][0] [L77] EXPR float_Array_0[1][0] >= -115292.1504606845700e+13F && float_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] EXPR (float_Array_0[1][0] >= -115292.1504606845700e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 1152921.504606845700e+12F && float_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] EXPR (float_Array_0[1][0] >= -115292.1504606845700e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 1152921.504606845700e+12F && float_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] CALL assume_abort_if_not((float_Array_0[1][0] >= -115292.1504606845700e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 1152921.504606845700e+12F && float_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_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_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] RET assume_abort_if_not((float_Array_0[1][0] >= -115292.1504606845700e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 1152921.504606845700e+12F && float_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L78] float_Array_0[0][1] = __VERIFIER_nondet_float() [L79] EXPR float_Array_0[0][1] [L79] EXPR float_Array_0[0][1] >= -461168.6018427382800e+13F && float_Array_0[0][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] EXPR float_Array_0[0][1] >= -461168.6018427382800e+13F && float_Array_0[0][1] <= -1.0e-20F [L79] EXPR float_Array_0[0][1] [L79] EXPR float_Array_0[0][1] >= -461168.6018427382800e+13F && float_Array_0[0][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] EXPR (float_Array_0[0][1] >= -461168.6018427382800e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 4611686.018427382800e+12F && float_Array_0[0][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] EXPR (float_Array_0[0][1] >= -461168.6018427382800e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 4611686.018427382800e+12F && float_Array_0[0][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] CALL assume_abort_if_not((float_Array_0[0][1] >= -461168.6018427382800e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 4611686.018427382800e+12F && float_Array_0[0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_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_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] RET assume_abort_if_not((float_Array_0[0][1] >= -461168.6018427382800e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 4611686.018427382800e+12F && float_Array_0[0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L80] unsigned_long_int_Array_0[0] = __VERIFIER_nondet_ulong() [L81] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L81] CALL assume_abort_if_not(unsigned_long_int_Array_0[0] >= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_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_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L81] RET assume_abort_if_not(unsigned_long_int_Array_0[0] >= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L82] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L82] CALL assume_abort_if_not(unsigned_long_int_Array_0[0] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_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_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L82] RET assume_abort_if_not(unsigned_long_int_Array_0[0] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L83] unsigned_short_int_Array_0[0] = __VERIFIER_nondet_ushort() [L84] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_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_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] RET assume_abort_if_not(unsigned_short_int_Array_0[0] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L85] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L85] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_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_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L85] RET assume_abort_if_not(unsigned_short_int_Array_0[0] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] RET updateVariables() [L101] CALL step() [L42] signed long int stepLocal_0 = last_1_signed_short_int_Array_0_0_; [L43] BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L43] COND TRUE BOOL_unsigned_char_Array_0[0] [L44] unsigned_short_int_Array_0[1] = last_1_signed_short_int_Array_0_0_ VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L50] EXPR unsigned_short_int_Array_0[1] [L50] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L50] COND TRUE unsigned_short_int_Array_0[1] == unsigned_short_int_Array_0[1] [L51] EXPR unsigned_short_int_Array_0[1] [L51] signed_short_int_Array_0[0] = (unsigned_short_int_Array_0[1] + -16) [L57] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L57] EXPR unsigned_short_int_Array_0[1] & last_1_unsigned_long_int_Array_0_1_ VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, stepLocal_0=-5, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L57] COND TRUE last_1_unsigned_long_int_Array_0_1_ >= (unsigned_short_int_Array_0[1] & last_1_unsigned_long_int_Array_0_1_) [L58] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L58] EXPR ((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < (unsigned_short_int_Array_0[0])) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : (unsigned_short_int_Array_0[0]) [L58] EXPR ((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < (unsigned_short_int_Array_0[0])) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : (unsigned_short_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, stepLocal_0=-5, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L58] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L58] EXPR ((((((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < (unsigned_short_int_Array_0[0])) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : (unsigned_short_int_Array_0[0])))) < ((unsigned_long_int_Array_0[0] - last_1_unsigned_long_int_Array_0_1_))) ? (((((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < (unsigned_short_int_Array_0[0])) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : (unsigned_short_int_Array_0[0])))) : ((unsigned_long_int_Array_0[0] - last_1_unsigned_long_int_Array_0_1_)) [L58] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L58] EXPR ((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < (unsigned_short_int_Array_0[0])) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : (unsigned_short_int_Array_0[0]) [L58] EXPR ((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < (unsigned_short_int_Array_0[0])) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : (unsigned_short_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, stepLocal_0=-5, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L58] EXPR ((((((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < (unsigned_short_int_Array_0[0])) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : (unsigned_short_int_Array_0[0])))) < ((unsigned_long_int_Array_0[0] - last_1_unsigned_long_int_Array_0_1_))) ? (((((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < (unsigned_short_int_Array_0[0])) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : (unsigned_short_int_Array_0[0])))) : ((unsigned_long_int_Array_0[0] - last_1_unsigned_long_int_Array_0_1_)) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, stepLocal_0=-5, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L58] unsigned_long_int_Array_0[1] = ((((((((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < (unsigned_short_int_Array_0[0])) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : (unsigned_short_int_Array_0[0])))) < ((unsigned_long_int_Array_0[0] - last_1_unsigned_long_int_Array_0_1_))) ? (((((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < (unsigned_short_int_Array_0[0])) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : (unsigned_short_int_Array_0[0])))) : ((unsigned_long_int_Array_0[0] - last_1_unsigned_long_int_Array_0_1_)))) [L66] EXPR signed_short_int_Array_0[0] [L66] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L66] COND TRUE signed_short_int_Array_0[0] < unsigned_short_int_Array_0[1] [L67] EXPR float_Array_0[1][0] [L67] EXPR float_Array_0[0][0] [L67] EXPR float_Array_0[0][1] [L67] float_Array_0[1][1] = (((10.25f + float_Array_0[1][0]) + float_Array_0[0][0]) + float_Array_0[0][1]) [L101] RET step() [L102] CALL, EXPR property() [L92] EXPR unsigned_short_int_Array_0[1] [L92] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92] EXPR (unsigned_short_int_Array_0[1] == unsigned_short_int_Array_0[1]) ? (signed_short_int_Array_0[0] == ((signed short int) (unsigned_short_int_Array_0[1] + -16))) : (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[0] == ((signed short int) unsigned_short_int_Array_0[1])) : 1) [L92] EXPR signed_short_int_Array_0[0] [L92] EXPR unsigned_short_int_Array_0[1] [L92] EXPR (unsigned_short_int_Array_0[1] == unsigned_short_int_Array_0[1]) ? (signed_short_int_Array_0[0] == ((signed short int) (unsigned_short_int_Array_0[1] + -16))) : (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[0] == ((signed short int) unsigned_short_int_Array_0[1])) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92] EXPR ((unsigned_short_int_Array_0[1] == unsigned_short_int_Array_0[1]) ? (signed_short_int_Array_0[0] == ((signed short int) (unsigned_short_int_Array_0[1] + -16))) : (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[0] == ((signed short int) unsigned_short_int_Array_0[1])) : 1)) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : ((last_1_signed_short_int_Array_0_0_ <= last_1_signed_short_int_Array_0_0_) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((((last_1_unsigned_long_int_Array_0_1_) > ((unsigned_short_int_Array_0[0] - 8))) ? (last_1_unsigned_long_int_Array_0_1_) : ((unsigned_short_int_Array_0[0] - 8)))))) : 1)) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92] EXPR ((unsigned_short_int_Array_0[1] == unsigned_short_int_Array_0[1]) ? (signed_short_int_Array_0[0] == ((signed short int) (unsigned_short_int_Array_0[1] + -16))) : (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[0] == ((signed short int) unsigned_short_int_Array_0[1])) : 1)) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : ((last_1_signed_short_int_Array_0_0_ <= last_1_signed_short_int_Array_0_0_) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((((last_1_unsigned_long_int_Array_0_1_) > ((unsigned_short_int_Array_0[0] - 8))) ? (last_1_unsigned_long_int_Array_0_1_) : ((unsigned_short_int_Array_0[0] - 8)))))) : 1)) [L92] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92] EXPR BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : ((last_1_signed_short_int_Array_0_0_ <= last_1_signed_short_int_Array_0_0_) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((((last_1_unsigned_long_int_Array_0_1_) > ((unsigned_short_int_Array_0[0] - 8))) ? (last_1_unsigned_long_int_Array_0_1_) : ((unsigned_short_int_Array_0[0] - 8)))))) : 1) [L92] EXPR unsigned_short_int_Array_0[1] [L92] EXPR BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : ((last_1_signed_short_int_Array_0_0_ <= last_1_signed_short_int_Array_0_0_) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((((last_1_unsigned_long_int_Array_0_1_) > ((unsigned_short_int_Array_0[0] - 8))) ? (last_1_unsigned_long_int_Array_0_1_) : ((unsigned_short_int_Array_0[0] - 8)))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92] EXPR ((unsigned_short_int_Array_0[1] == unsigned_short_int_Array_0[1]) ? (signed_short_int_Array_0[0] == ((signed short int) (unsigned_short_int_Array_0[1] + -16))) : (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[0] == ((signed short int) unsigned_short_int_Array_0[1])) : 1)) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : ((last_1_signed_short_int_Array_0_0_ <= last_1_signed_short_int_Array_0_0_) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((((last_1_unsigned_long_int_Array_0_1_) > ((unsigned_short_int_Array_0[0] - 8))) ? (last_1_unsigned_long_int_Array_0_1_) : ((unsigned_short_int_Array_0[0] - 8)))))) : 1)) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92] EXPR (((unsigned_short_int_Array_0[1] == unsigned_short_int_Array_0[1]) ? (signed_short_int_Array_0[0] == ((signed short int) (unsigned_short_int_Array_0[1] + -16))) : (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[0] == ((signed short int) unsigned_short_int_Array_0[1])) : 1)) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : ((last_1_signed_short_int_Array_0_0_ <= last_1_signed_short_int_Array_0_0_) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((((last_1_unsigned_long_int_Array_0_1_) > ((unsigned_short_int_Array_0[0] - 8))) ? (last_1_unsigned_long_int_Array_0_1_) : ((unsigned_short_int_Array_0[0] - 8)))))) : 1))) && ((signed_short_int_Array_0[0] < unsigned_short_int_Array_0[1]) ? (float_Array_0[1][1] == ((float) (((10.25f + float_Array_0[1][0]) + float_Array_0[0][0]) + float_Array_0[0][1]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92] EXPR (((unsigned_short_int_Array_0[1] == unsigned_short_int_Array_0[1]) ? (signed_short_int_Array_0[0] == ((signed short int) (unsigned_short_int_Array_0[1] + -16))) : (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[0] == ((signed short int) unsigned_short_int_Array_0[1])) : 1)) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : ((last_1_signed_short_int_Array_0_0_ <= last_1_signed_short_int_Array_0_0_) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((((last_1_unsigned_long_int_Array_0_1_) > ((unsigned_short_int_Array_0[0] - 8))) ? (last_1_unsigned_long_int_Array_0_1_) : ((unsigned_short_int_Array_0[0] - 8)))))) : 1))) && ((signed_short_int_Array_0[0] < unsigned_short_int_Array_0[1]) ? (float_Array_0[1][1] == ((float) (((10.25f + float_Array_0[1][0]) + float_Array_0[0][0]) + float_Array_0[0][1]))) : 1) [L92] EXPR signed_short_int_Array_0[0] [L92] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92] EXPR (signed_short_int_Array_0[0] < unsigned_short_int_Array_0[1]) ? (float_Array_0[1][1] == ((float) (((10.25f + float_Array_0[1][0]) + float_Array_0[0][0]) + float_Array_0[0][1]))) : 1 [L92] EXPR float_Array_0[1][1] [L92] EXPR float_Array_0[1][0] [L92] EXPR float_Array_0[0][0] [L92] EXPR float_Array_0[0][1] [L92] EXPR (signed_short_int_Array_0[0] < unsigned_short_int_Array_0[1]) ? (float_Array_0[1][1] == ((float) (((10.25f + float_Array_0[1][0]) + float_Array_0[0][0]) + float_Array_0[0][1]))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92] EXPR (((unsigned_short_int_Array_0[1] == unsigned_short_int_Array_0[1]) ? (signed_short_int_Array_0[0] == ((signed short int) (unsigned_short_int_Array_0[1] + -16))) : (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[0] == ((signed short int) unsigned_short_int_Array_0[1])) : 1)) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : ((last_1_signed_short_int_Array_0_0_ <= last_1_signed_short_int_Array_0_0_) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((((last_1_unsigned_long_int_Array_0_1_) > ((unsigned_short_int_Array_0[0] - 8))) ? (last_1_unsigned_long_int_Array_0_1_) : ((unsigned_short_int_Array_0[0] - 8)))))) : 1))) && ((signed_short_int_Array_0[0] < unsigned_short_int_Array_0[1]) ? (float_Array_0[1][1] == ((float) (((10.25f + float_Array_0[1][0]) + float_Array_0[0][0]) + float_Array_0[0][1]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92] EXPR ((((unsigned_short_int_Array_0[1] == unsigned_short_int_Array_0[1]) ? (signed_short_int_Array_0[0] == ((signed short int) (unsigned_short_int_Array_0[1] + -16))) : (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[0] == ((signed short int) unsigned_short_int_Array_0[1])) : 1)) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : ((last_1_signed_short_int_Array_0_0_ <= last_1_signed_short_int_Array_0_0_) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((((last_1_unsigned_long_int_Array_0_1_) > ((unsigned_short_int_Array_0[0] - 8))) ? (last_1_unsigned_long_int_Array_0_1_) : ((unsigned_short_int_Array_0[0] - 8)))))) : 1))) && ((signed_short_int_Array_0[0] < unsigned_short_int_Array_0[1]) ? (float_Array_0[1][1] == ((float) (((10.25f + float_Array_0[1][0]) + float_Array_0[0][0]) + float_Array_0[0][1]))) : 1)) && ((last_1_unsigned_long_int_Array_0_1_ >= (unsigned_short_int_Array_0[1] & last_1_unsigned_long_int_Array_0_1_)) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((((((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < (unsigned_short_int_Array_0[0])) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : (unsigned_short_int_Array_0[0])))) < ((unsigned_long_int_Array_0[0] - last_1_unsigned_long_int_Array_0_1_))) ? (((((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < (unsigned_short_int_Array_0[0])) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : (unsigned_short_int_Array_0[0])))) : ((unsigned_long_int_Array_0[0] - last_1_unsigned_long_int_Array_0_1_)))))) : ((5.7 < float_Array_0[0][0]) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) last_1_unsigned_long_int_Array_0_1_)) : (unsigned_long_int_Array_0[1] == ((unsigned long int) last_1_unsigned_long_int_Array_0_1_)))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92] EXPR ((((unsigned_short_int_Array_0[1] == unsigned_short_int_Array_0[1]) ? (signed_short_int_Array_0[0] == ((signed short int) (unsigned_short_int_Array_0[1] + -16))) : (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[0] == ((signed short int) unsigned_short_int_Array_0[1])) : 1)) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : ((last_1_signed_short_int_Array_0_0_ <= last_1_signed_short_int_Array_0_0_) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((((last_1_unsigned_long_int_Array_0_1_) > ((unsigned_short_int_Array_0[0] - 8))) ? (last_1_unsigned_long_int_Array_0_1_) : ((unsigned_short_int_Array_0[0] - 8)))))) : 1))) && ((signed_short_int_Array_0[0] < unsigned_short_int_Array_0[1]) ? (float_Array_0[1][1] == ((float) (((10.25f + float_Array_0[1][0]) + float_Array_0[0][0]) + float_Array_0[0][1]))) : 1)) && ((last_1_unsigned_long_int_Array_0_1_ >= (unsigned_short_int_Array_0[1] & last_1_unsigned_long_int_Array_0_1_)) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((((((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < (unsigned_short_int_Array_0[0])) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : (unsigned_short_int_Array_0[0])))) < ((unsigned_long_int_Array_0[0] - last_1_unsigned_long_int_Array_0_1_))) ? (((((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < (unsigned_short_int_Array_0[0])) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : (unsigned_short_int_Array_0[0])))) : ((unsigned_long_int_Array_0[0] - last_1_unsigned_long_int_Array_0_1_)))))) : ((5.7 < float_Array_0[0][0]) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) last_1_unsigned_long_int_Array_0_1_)) : (unsigned_long_int_Array_0[1] == ((unsigned long int) last_1_unsigned_long_int_Array_0_1_)))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92-L93] return ((((unsigned_short_int_Array_0[1] == unsigned_short_int_Array_0[1]) ? (signed_short_int_Array_0[0] == ((signed short int) (unsigned_short_int_Array_0[1] + -16))) : (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[0] == ((signed short int) unsigned_short_int_Array_0[1])) : 1)) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : ((last_1_signed_short_int_Array_0_0_ <= last_1_signed_short_int_Array_0_0_) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((((last_1_unsigned_long_int_Array_0_1_) > ((unsigned_short_int_Array_0[0] - 8))) ? (last_1_unsigned_long_int_Array_0_1_) : ((unsigned_short_int_Array_0[0] - 8)))))) : 1))) && ((signed_short_int_Array_0[0] < unsigned_short_int_Array_0[1]) ? (float_Array_0[1][1] == ((float) (((10.25f + float_Array_0[1][0]) + float_Array_0[0][0]) + float_Array_0[0][1]))) : 1)) && ((last_1_unsigned_long_int_Array_0_1_ >= (unsigned_short_int_Array_0[1] & last_1_unsigned_long_int_Array_0_1_)) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((((((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < (unsigned_short_int_Array_0[0])) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : (unsigned_short_int_Array_0[0])))) < ((unsigned_long_int_Array_0[0] - last_1_unsigned_long_int_Array_0_1_))) ? (((((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < (unsigned_short_int_Array_0[0])) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : (unsigned_short_int_Array_0[0])))) : ((unsigned_long_int_Array_0[0] - last_1_unsigned_long_int_Array_0_1_)))))) : ((5.7 < float_Array_0[0][0]) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) last_1_unsigned_long_int_Array_0_1_)) : (unsigned_long_int_Array_0[1] == ((unsigned long int) last_1_unsigned_long_int_Array_0_1_)))) ; [L102] RET, EXPR property() [L102] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_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_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 105 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.8s, OverallIterations: 16, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2990 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2989 mSDsluCounter, 10055 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7561 mSDsCounter, 268 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4295 IncrementalHoareTripleChecker+Invalid, 4563 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 268 mSolverCounterUnsat, 2494 mSDtfsCounter, 4295 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 820 GetRequests, 668 SyntacticMatches, 1 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 714 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=318occurred in iteration=11, InterpolantAutomatonStates: 110, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 15 MinimizatonAttempts, 1354 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 9.3s InterpolantComputationTime, 1718 NumberOfCodeBlocks, 1718 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1792 ConstructedInterpolants, 0 QuantifiedInterpolants, 10613 SizeOfPredicates, 15 NumberOfNonLiveVariables, 736 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 19 InterpolantComputations, 14 PerfectInterpolantSequences, 2670/2736 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 01:28:47,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-22.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 f15b1832185bc6e5ed8ca3a7e02ddd56b37c4032577256d66dd546b8130db09b --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:28:49,646 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:28:49,732 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 01:28:49,738 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:28:49,739 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:28:49,774 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:28:49,774 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:28:49,775 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:28:49,775 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:28:49,775 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:28:49,776 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:28:49,776 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:28:49,777 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:28:49,777 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:28:49,778 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:28:49,779 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:28:49,779 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:28:49,779 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:28:49,780 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:28:49,780 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:28:49,781 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:28:49,786 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:28:49,786 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:28:49,786 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 01:28:49,786 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 01:28:49,787 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:28:49,787 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 01:28:49,787 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:28:49,787 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:28:49,787 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:28:49,788 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:28:49,788 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:28:49,788 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:28:49,788 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:28:49,789 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:28:49,789 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:28:49,790 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:28:49,790 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:28:49,791 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 01:28:49,791 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 01:28:49,791 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:28:49,791 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:28:49,791 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:28:49,792 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:28:49,792 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 -> f15b1832185bc6e5ed8ca3a7e02ddd56b37c4032577256d66dd546b8130db09b [2024-11-09 01:28:50,132 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:28:50,156 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:28:50,159 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:28:50,160 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:28:50,161 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:28:50,162 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-22.i [2024-11-09 01:28:51,736 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:28:51,977 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:28:51,978 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-22.i [2024-11-09 01:28:51,991 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f8f65f06/0f6c2a94b2db42c081c1d97402d9458f/FLAGf1a8188cd [2024-11-09 01:28:52,009 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f8f65f06/0f6c2a94b2db42c081c1d97402d9458f [2024-11-09 01:28:52,012 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:28:52,014 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:28:52,017 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:28:52,019 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:28:52,024 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:28:52,025 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:28:52" (1/1) ... [2024-11-09 01:28:52,026 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@342f42a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:28:52, skipping insertion in model container [2024-11-09 01:28:52,026 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:28:52" (1/1) ... [2024-11-09 01:28:52,057 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:28:52,239 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-22.i[916,929] [2024-11-09 01:28:52,316 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:28:52,339 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:28:52,350 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-22.i[916,929] [2024-11-09 01:28:52,405 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:28:52,431 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:28:52,432 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:28:52 WrapperNode [2024-11-09 01:28:52,432 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:28:52,434 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:28:52,434 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:28:52,434 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:28:52,441 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:28:52" (1/1) ... [2024-11-09 01:28:52,459 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:28:52" (1/1) ... [2024-11-09 01:28:52,502 INFO L138 Inliner]: procedures = 36, calls = 121, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 400 [2024-11-09 01:28:52,502 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:28:52,503 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:28:52,503 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:28:52,503 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:28:52,513 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:28:52" (1/1) ... [2024-11-09 01:28:52,513 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:28:52" (1/1) ... [2024-11-09 01:28:52,525 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:28:52" (1/1) ... [2024-11-09 01:28:52,558 INFO L175 MemorySlicer]: Split 96 memory accesses to 6 slices as follows [2, 8, 29, 8, 16, 33]. 34 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 4, 1, 2, 2]. The 14 writes are split as follows [0, 1, 4, 2, 4, 3]. [2024-11-09 01:28:52,558 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:28:52" (1/1) ... [2024-11-09 01:28:52,558 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:28:52" (1/1) ... [2024-11-09 01:28:52,577 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:28:52" (1/1) ... [2024-11-09 01:28:52,583 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:28:52" (1/1) ... [2024-11-09 01:28:52,588 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:28:52" (1/1) ... [2024-11-09 01:28:52,591 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:28:52" (1/1) ... [2024-11-09 01:28:52,598 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:28:52,599 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:28:52,599 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:28:52,599 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:28:52,600 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:28:52" (1/1) ... [2024-11-09 01:28:52,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:28:52,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:28:52,642 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 01:28:52,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 01:28:52,686 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:28:52,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-09 01:28:52,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-09 01:28:52,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-09 01:28:52,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-09 01:28:52,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-09 01:28:52,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-09 01:28:52,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-09 01:28:52,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-09 01:28:52,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-09 01:28:52,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-09 01:28:52,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-09 01:28:52,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-09 01:28:52,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 01:28:52,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 01:28:52,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-09 01:28:52,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-09 01:28:52,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-09 01:28:52,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-09 01:28:52,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-09 01:28:52,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-09 01:28:52,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-09 01:28:52,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-09 01:28:52,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-09 01:28:52,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-09 01:28:52,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-09 01:28:52,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-09 01:28:52,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-09 01:28:52,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-09 01:28:52,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-09 01:28:52,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-09 01:28:52,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-09 01:28:52,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-09 01:28:52,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-09 01:28:52,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-09 01:28:52,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-09 01:28:52,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-09 01:28:52,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-09 01:28:52,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-09 01:28:52,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-09 01:28:52,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-09 01:28:52,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-09 01:28:52,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-11-09 01:28:52,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-09 01:28:52,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-09 01:28:52,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-09 01:28:52,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-09 01:28:52,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-09 01:28:52,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-09 01:28:52,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-09 01:28:52,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-09 01:28:52,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-09 01:28:52,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-09 01:28:52,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-09 01:28:52,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-11-09 01:28:52,693 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:28:52,693 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:28:52,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:28:52,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:28:52,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-09 01:28:52,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-09 01:28:52,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-09 01:28:52,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-09 01:28:52,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-09 01:28:52,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-09 01:28:52,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-09 01:28:52,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-09 01:28:52,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-09 01:28:52,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-09 01:28:52,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-09 01:28:52,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-11-09 01:28:52,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-09 01:28:52,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-09 01:28:52,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-09 01:28:52,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-09 01:28:52,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-09 01:28:52,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-09 01:28:52,883 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:28:52,886 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:28:54,416 INFO L? ?]: Removed 103 outVars from TransFormulas that were not future-live. [2024-11-09 01:28:54,416 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:28:54,436 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:28:54,438 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:28:54,438 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:28:54 BoogieIcfgContainer [2024-11-09 01:28:54,438 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:28:54,440 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:28:54,441 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:28:54,464 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:28:54,464 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:28:52" (1/3) ... [2024-11-09 01:28:54,465 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e444fab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:28:54, skipping insertion in model container [2024-11-09 01:28:54,465 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:28:52" (2/3) ... [2024-11-09 01:28:54,465 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e444fab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:28:54, skipping insertion in model container [2024-11-09 01:28:54,465 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:28:54" (3/3) ... [2024-11-09 01:28:54,467 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-22.i [2024-11-09 01:28:54,483 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:28:54,483 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:28:54,553 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:28:54,561 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;@7cb226b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:28:54,561 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:28:54,566 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 87 states have (on average 1.4482758620689655) internal successors, (126), 88 states have internal predecessors, (126), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 01:28:54,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-09 01:28:54,577 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:28:54,578 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:28:54,579 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:28:54,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:28:54,585 INFO L85 PathProgramCache]: Analyzing trace with hash 319776311, now seen corresponding path program 1 times [2024-11-09 01:28:54,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:28:54,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1543490058] [2024-11-09 01:28:54,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:54,597 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:28:54,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:28:54,599 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:28:54,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 01:28:54,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:54,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 01:28:54,984 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:28:55,023 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-09 01:28:55,024 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:28:55,025 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:28:55,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1543490058] [2024-11-09 01:28:55,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1543490058] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:28:55,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:28:55,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:28:55,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044796104] [2024-11-09 01:28:55,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:28:55,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:28:55,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:28:55,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:28:55,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:28:55,062 INFO L87 Difference]: Start difference. First operand has 99 states, 87 states have (on average 1.4482758620689655) internal successors, (126), 88 states have internal predecessors, (126), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-09 01:28:55,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:28:55,091 INFO L93 Difference]: Finished difference Result 188 states and 286 transitions. [2024-11-09 01:28:55,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:28:55,094 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 89 [2024-11-09 01:28:55,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:28:55,102 INFO L225 Difference]: With dead ends: 188 [2024-11-09 01:28:55,103 INFO L226 Difference]: Without dead ends: 92 [2024-11-09 01:28:55,106 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:28:55,119 INFO L432 NwaCegarLoop]: 129 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, 129 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:28:55,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:28:55,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-09 01:28:55,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-09 01:28:55,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 81 states have (on average 1.3703703703703705) internal successors, (111), 81 states have internal predecessors, (111), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 01:28:55,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 129 transitions. [2024-11-09 01:28:55,167 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 129 transitions. Word has length 89 [2024-11-09 01:28:55,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:28:55,170 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 129 transitions. [2024-11-09 01:28:55,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-09 01:28:55,170 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 129 transitions. [2024-11-09 01:28:55,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-09 01:28:55,176 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:28:55,177 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:28:55,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-09 01:28:55,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:28:55,378 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:28:55,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:28:55,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1115954811, now seen corresponding path program 1 times [2024-11-09 01:28:55,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:28:55,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1366200535] [2024-11-09 01:28:55,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:55,380 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:28:55,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:28:55,384 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:28:55,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 01:28:55,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:55,777 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 01:28:55,781 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:28:55,823 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-09 01:28:55,824 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:28:55,824 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:28:55,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1366200535] [2024-11-09 01:28:55,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1366200535] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:28:55,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:28:55,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:28:55,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687319988] [2024-11-09 01:28:55,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:28:55,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:28:55,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:28:55,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:28:55,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:28:55,831 INFO L87 Difference]: Start difference. First operand 92 states and 129 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-09 01:28:55,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:28:55,885 INFO L93 Difference]: Finished difference Result 183 states and 258 transitions. [2024-11-09 01:28:55,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:28:55,890 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 92 [2024-11-09 01:28:55,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:28:55,891 INFO L225 Difference]: With dead ends: 183 [2024-11-09 01:28:55,891 INFO L226 Difference]: Without dead ends: 94 [2024-11-09 01:28:55,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:28:55,893 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 370 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-09 01:28:55,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 370 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:28:55,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-09 01:28:55,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-09 01:28:55,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 83 states have (on average 1.3614457831325302) internal successors, (113), 83 states have internal predecessors, (113), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 01:28:55,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 131 transitions. [2024-11-09 01:28:55,905 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 131 transitions. Word has length 92 [2024-11-09 01:28:55,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:28:55,907 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 131 transitions. [2024-11-09 01:28:55,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-09 01:28:55,907 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 131 transitions. [2024-11-09 01:28:55,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-09 01:28:55,909 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:28:55,909 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:28:55,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-09 01:28:56,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:28:56,114 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:28:56,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:28:56,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1444908035, now seen corresponding path program 1 times [2024-11-09 01:28:56,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:28:56,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [353666899] [2024-11-09 01:28:56,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:56,117 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:28:56,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:28:56,118 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:28:56,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-09 01:28:56,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:56,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 01:28:56,513 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:28:57,171 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-09 01:28:57,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 35 [2024-11-09 01:28:57,404 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 84 treesize of output 60 [2024-11-09 01:28:57,412 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 63 treesize of output 51 [2024-11-09 01:28:57,452 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 01:28:57,454 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:28:57,454 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:28:57,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [353666899] [2024-11-09 01:28:57,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [353666899] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:28:57,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:28:57,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 01:28:57,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141017300] [2024-11-09 01:28:57,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:28:57,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 01:28:57,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:28:57,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 01:28:57,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:28:57,459 INFO L87 Difference]: Start difference. First operand 94 states and 131 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 01:28:58,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:28:58,517 INFO L93 Difference]: Finished difference Result 503 states and 704 transitions. [2024-11-09 01:28:58,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 01:28:58,518 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 92 [2024-11-09 01:28:58,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:28:58,525 INFO L225 Difference]: With dead ends: 503 [2024-11-09 01:28:58,525 INFO L226 Difference]: Without dead ends: 412 [2024-11-09 01:28:58,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-09 01:28:58,528 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 418 mSDsluCounter, 1158 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 1412 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 01:28:58,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 1412 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 01:28:58,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2024-11-09 01:28:58,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 359. [2024-11-09 01:28:58,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 318 states have (on average 1.371069182389937) internal successors, (436), 318 states have internal predecessors, (436), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-09 01:28:58,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 508 transitions. [2024-11-09 01:28:58,584 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 508 transitions. Word has length 92 [2024-11-09 01:28:58,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:28:58,585 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 508 transitions. [2024-11-09 01:28:58,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 01:28:58,585 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 508 transitions. [2024-11-09 01:28:58,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-09 01:28:58,587 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:28:58,588 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:28:58,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-09 01:28:58,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:28:58,793 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:28:58,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:28:58,793 INFO L85 PathProgramCache]: Analyzing trace with hash 20350527, now seen corresponding path program 1 times [2024-11-09 01:28:58,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:28:58,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1454166959] [2024-11-09 01:28:58,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:58,794 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:28:58,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:28:58,797 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:28:58,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-09 01:28:59,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:59,132 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 01:28:59,139 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:28:59,165 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-09 01:28:59,305 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 16 treesize of output 12 [2024-11-09 01:28:59,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-09 01:28:59,345 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 01:28:59,345 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:28:59,345 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:28:59,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1454166959] [2024-11-09 01:28:59,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1454166959] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:28:59,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:28:59,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:28:59,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647869910] [2024-11-09 01:28:59,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:28:59,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:28:59,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:28:59,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:28:59,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:28:59,348 INFO L87 Difference]: Start difference. First operand 359 states and 508 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 01:28:59,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:28:59,860 INFO L93 Difference]: Finished difference Result 723 states and 1013 transitions. [2024-11-09 01:28:59,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 01:28:59,862 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 93 [2024-11-09 01:28:59,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:28:59,865 INFO L225 Difference]: With dead ends: 723 [2024-11-09 01:28:59,865 INFO L226 Difference]: Without dead ends: 367 [2024-11-09 01:28:59,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-09 01:28:59,868 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 405 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 01:28:59,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 1013 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 01:28:59,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2024-11-09 01:28:59,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 271. [2024-11-09 01:28:59,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 240 states have (on average 1.3625) internal successors, (327), 240 states have internal predecessors, (327), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-09 01:28:59,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 381 transitions. [2024-11-09 01:28:59,899 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 381 transitions. Word has length 93 [2024-11-09 01:28:59,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:28:59,900 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 381 transitions. [2024-11-09 01:28:59,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 01:28:59,902 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 381 transitions. [2024-11-09 01:28:59,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-09 01:28:59,907 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:28:59,907 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:28:59,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-09 01:29:00,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:29:00,108 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:29:00,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:29:00,109 INFO L85 PathProgramCache]: Analyzing trace with hash -2059599653, now seen corresponding path program 1 times [2024-11-09 01:29:00,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:29:00,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [88228444] [2024-11-09 01:29:00,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:29:00,110 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:29:00,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:29:00,112 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:29:00,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-09 01:29:00,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:29:00,448 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 01:29:00,451 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:29:00,471 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 01:29:00,472 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:29:00,472 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:29:00,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [88228444] [2024-11-09 01:29:00,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [88228444] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:29:00,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:29:00,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:29:00,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874865022] [2024-11-09 01:29:00,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:29:00,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:29:00,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:29:00,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:29:00,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:29:00,474 INFO L87 Difference]: Start difference. First operand 271 states and 381 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 01:29:00,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:29:00,517 INFO L93 Difference]: Finished difference Result 553 states and 779 transitions. [2024-11-09 01:29:00,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:29:00,518 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 93 [2024-11-09 01:29:00,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:29:00,523 INFO L225 Difference]: With dead ends: 553 [2024-11-09 01:29:00,523 INFO L226 Difference]: Without dead ends: 285 [2024-11-09 01:29:00,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:29:00,529 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 20 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:29:00,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 248 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:29:00,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-11-09 01:29:00,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 199. [2024-11-09 01:29:00,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 178 states have (on average 1.353932584269663) internal successors, (241), 178 states have internal predecessors, (241), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 01:29:00,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 277 transitions. [2024-11-09 01:29:00,550 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 277 transitions. Word has length 93 [2024-11-09 01:29:00,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:29:00,552 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 277 transitions. [2024-11-09 01:29:00,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 01:29:00,552 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 277 transitions. [2024-11-09 01:29:00,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-09 01:29:00,555 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:29:00,555 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:29:00,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-09 01:29:00,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:29:00,756 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:29:00,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:29:00,756 INFO L85 PathProgramCache]: Analyzing trace with hash 88970302, now seen corresponding path program 1 times [2024-11-09 01:29:00,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:29:00,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1181971113] [2024-11-09 01:29:00,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:29:00,757 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:29:00,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:29:00,760 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:29:00,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-09 01:29:01,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:29:01,089 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 01:29:01,092 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:29:01,111 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-09 01:29:01,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-09 01:29:01,373 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 51 treesize of output 33 [2024-11-09 01:29:01,411 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 01:29:01,411 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:29:01,411 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:29:01,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1181971113] [2024-11-09 01:29:01,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1181971113] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:29:01,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:29:01,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 01:29:01,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030393518] [2024-11-09 01:29:01,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:29:01,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 01:29:01,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:29:01,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 01:29:01,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:29:01,413 INFO L87 Difference]: Start difference. First operand 199 states and 277 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 01:29:01,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:29:01,874 INFO L93 Difference]: Finished difference Result 369 states and 508 transitions. [2024-11-09 01:29:01,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 01:29:01,875 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 94 [2024-11-09 01:29:01,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:29:01,877 INFO L225 Difference]: With dead ends: 369 [2024-11-09 01:29:01,877 INFO L226 Difference]: Without dead ends: 278 [2024-11-09 01:29:01,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-09 01:29:01,879 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 285 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 01:29:01,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 919 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 01:29:01,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-11-09 01:29:01,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 207. [2024-11-09 01:29:01,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 186 states have (on average 1.3548387096774193) internal successors, (252), 186 states have internal predecessors, (252), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 01:29:01,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 288 transitions. [2024-11-09 01:29:01,895 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 288 transitions. Word has length 94 [2024-11-09 01:29:01,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:29:01,896 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 288 transitions. [2024-11-09 01:29:01,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 01:29:01,896 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 288 transitions. [2024-11-09 01:29:01,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-09 01:29:01,900 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:29:01,900 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:29:01,912 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-09 01:29:02,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:29:02,101 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:29:02,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:29:02,102 INFO L85 PathProgramCache]: Analyzing trace with hash 981629577, now seen corresponding path program 1 times [2024-11-09 01:29:02,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:29:02,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1457398352] [2024-11-09 01:29:02,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:29:02,103 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:29:02,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:29:02,104 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:29:02,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-09 01:29:02,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:29:02,408 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 01:29:02,412 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:29:02,432 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-09 01:29:02,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 16 treesize of output 12 [2024-11-09 01:29:02,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-09 01:29:02,628 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 01:29:02,628 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:29:02,629 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:29:02,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1457398352] [2024-11-09 01:29:02,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1457398352] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:29:02,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:29:02,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:29:02,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392555286] [2024-11-09 01:29:02,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:29:02,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:29:02,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:29:02,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:29:02,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:29:02,631 INFO L87 Difference]: Start difference. First operand 207 states and 288 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 01:29:02,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:29:02,953 INFO L93 Difference]: Finished difference Result 418 states and 576 transitions. [2024-11-09 01:29:02,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 01:29:02,954 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 94 [2024-11-09 01:29:02,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:29:02,956 INFO L225 Difference]: With dead ends: 418 [2024-11-09 01:29:02,958 INFO L226 Difference]: Without dead ends: 319 [2024-11-09 01:29:02,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:29:02,959 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 328 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 949 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:29:02,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 949 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:29:02,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-11-09 01:29:02,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 203. [2024-11-09 01:29:02,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 182 states have (on average 1.3461538461538463) internal successors, (245), 182 states have internal predecessors, (245), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 01:29:02,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 281 transitions. [2024-11-09 01:29:02,978 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 281 transitions. Word has length 94 [2024-11-09 01:29:02,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:29:02,979 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 281 transitions. [2024-11-09 01:29:02,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 01:29:02,979 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 281 transitions. [2024-11-09 01:29:02,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-09 01:29:02,982 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:29:02,982 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:29:02,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-09 01:29:03,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:29:03,183 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:29:03,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:29:03,183 INFO L85 PathProgramCache]: Analyzing trace with hash -186725034, now seen corresponding path program 1 times [2024-11-09 01:29:03,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:29:03,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [169145648] [2024-11-09 01:29:03,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:29:03,184 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:29:03,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:29:03,185 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:29:03,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-09 01:29:03,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:29:03,500 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 01:29:03,503 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:29:03,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-09 01:29:03,830 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 50 proven. 3 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-09 01:29:03,830 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:29:04,047 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-09 01:29:04,110 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:29:04,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [169145648] [2024-11-09 01:29:04,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [169145648] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:29:04,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [569457785] [2024-11-09 01:29:04,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:29:04,111 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 01:29:04,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-09 01:29:04,114 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-09 01:29:04,115 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-09 01:29:04,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:29:04,838 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 01:29:04,843 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:29:05,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-09 01:29:05,054 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 23 treesize of output 19 [2024-11-09 01:29:05,186 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 82 treesize of output 58 [2024-11-09 01:29:05,190 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 57 treesize of output 45 [2024-11-09 01:29:05,250 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 01:29:05,250 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:29:05,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [569457785] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:29:05,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 01:29:05,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 13 [2024-11-09 01:29:05,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560830959] [2024-11-09 01:29:05,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:29:05,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 01:29:05,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:29:05,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 01:29:05,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2024-11-09 01:29:05,254 INFO L87 Difference]: Start difference. First operand 203 states and 281 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 01:29:06,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:29:06,187 INFO L93 Difference]: Finished difference Result 715 states and 992 transitions. [2024-11-09 01:29:06,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 01:29:06,188 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 95 [2024-11-09 01:29:06,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:29:06,191 INFO L225 Difference]: With dead ends: 715 [2024-11-09 01:29:06,191 INFO L226 Difference]: Without dead ends: 624 [2024-11-09 01:29:06,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=123, Invalid=633, Unknown=0, NotChecked=0, Total=756 [2024-11-09 01:29:06,193 INFO L432 NwaCegarLoop]: 258 mSDtfsCounter, 405 mSDsluCounter, 1370 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 1628 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 01:29:06,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 1628 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 01:29:06,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2024-11-09 01:29:06,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 265. [2024-11-09 01:29:06,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 234 states have (on average 1.3418803418803418) internal successors, (314), 234 states have internal predecessors, (314), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-09 01:29:06,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 368 transitions. [2024-11-09 01:29:06,226 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 368 transitions. Word has length 95 [2024-11-09 01:29:06,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:29:06,226 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 368 transitions. [2024-11-09 01:29:06,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 01:29:06,227 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 368 transitions. [2024-11-09 01:29:06,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-09 01:29:06,228 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:29:06,228 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:29:06,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-09 01:29:06,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Forceful destruction successful, exit code 0 [2024-11-09 01:29:06,629 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-09 01:29:06,629 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:29:06,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:29:06,630 INFO L85 PathProgramCache]: Analyzing trace with hash -320738540, now seen corresponding path program 1 times [2024-11-09 01:29:06,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:29:06,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [913671202] [2024-11-09 01:29:06,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:29:06,630 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:29:06,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:29:06,632 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:29:06,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-09 01:29:06,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:29:06,919 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 01:29:06,921 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:29:06,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-09 01:29:07,219 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 15 treesize of output 7 [2024-11-09 01:29:07,245 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 78 proven. 9 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-11-09 01:29:07,245 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:29:07,798 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 39 treesize of output 27 [2024-11-09 01:29:07,863 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:29:07,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [913671202] [2024-11-09 01:29:07,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [913671202] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:29:07,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [49198573] [2024-11-09 01:29:07,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:29:07,864 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 01:29:07,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-09 01:29:07,867 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 01:29:07,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2024-11-09 01:29:08,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:29:08,818 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 01:29:08,821 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:29:09,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2024-11-09 01:29:09,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2024-11-09 01:29:09,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 54 [2024-11-09 01:29:09,446 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:29:09,447 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 87 treesize of output 59 [2024-11-09 01:29:09,500 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 50 proven. 3 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-09 01:29:09,500 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:29:09,648 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 01:29:09,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [49198573] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 01:29:09,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-09 01:29:09,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9, 11] total 22 [2024-11-09 01:29:09,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899433225] [2024-11-09 01:29:09,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:29:09,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:29:09,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:29:09,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:29:09,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=709, Unknown=0, NotChecked=0, Total=812 [2024-11-09 01:29:09,650 INFO L87 Difference]: Start difference. First operand 265 states and 368 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 01:29:09,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:29:09,933 INFO L93 Difference]: Finished difference Result 446 states and 620 transitions. [2024-11-09 01:29:09,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:29:09,934 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 95 [2024-11-09 01:29:09,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:29:09,936 INFO L225 Difference]: With dead ends: 446 [2024-11-09 01:29:09,936 INFO L226 Difference]: Without dead ends: 355 [2024-11-09 01:29:09,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=111, Invalid=819, Unknown=0, NotChecked=0, Total=930 [2024-11-09 01:29:09,937 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 110 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:29:09,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 588 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:29:09,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2024-11-09 01:29:09,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 217. [2024-11-09 01:29:09,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 196 states have (on average 1.346938775510204) internal successors, (264), 196 states have internal predecessors, (264), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 01:29:09,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 300 transitions. [2024-11-09 01:29:09,949 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 300 transitions. Word has length 95 [2024-11-09 01:29:09,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:29:09,949 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 300 transitions. [2024-11-09 01:29:09,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 01:29:09,950 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 300 transitions. [2024-11-09 01:29:09,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-09 01:29:09,951 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:29:09,951 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:29:09,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-09 01:29:10,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Ended with exit code 0 [2024-11-09 01:29:10,351 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,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-09 01:29:10,352 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:29:10,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:29:10,352 INFO L85 PathProgramCache]: Analyzing trace with hash -485344457, now seen corresponding path program 1 times [2024-11-09 01:29:10,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:29:10,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1921029023] [2024-11-09 01:29:10,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:29:10,353 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:29:10,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:29:10,354 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:29:10,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-09 01:29:10,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:29:10,704 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 01:29:10,707 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:29:11,031 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-09 01:29:11,079 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 39 treesize of output 27 [2024-11-09 01:29:11,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2024-11-09 01:29:11,130 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 25 treesize of output 17 [2024-11-09 01:29:11,140 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 01:29:11,140 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:29:11,140 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:29:11,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1921029023] [2024-11-09 01:29:11,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1921029023] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:29:11,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:29:11,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:29:11,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753426985] [2024-11-09 01:29:11,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:29:11,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 01:29:11,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:29:11,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 01:29:11,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:29:11,141 INFO L87 Difference]: Start difference. First operand 217 states and 300 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 01:29:12,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:29:12,511 INFO L93 Difference]: Finished difference Result 415 states and 574 transitions. [2024-11-09 01:29:12,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:29:12,512 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2024-11-09 01:29:12,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:29:12,514 INFO L225 Difference]: With dead ends: 415 [2024-11-09 01:29:12,514 INFO L226 Difference]: Without dead ends: 310 [2024-11-09 01:29:12,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:29:12,515 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 271 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:29:12,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 800 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 01:29:12,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2024-11-09 01:29:12,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 306. [2024-11-09 01:29:12,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 275 states have (on average 1.3490909090909091) internal successors, (371), 275 states have internal predecessors, (371), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-09 01:29:12,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 425 transitions. [2024-11-09 01:29:12,531 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 425 transitions. Word has length 96 [2024-11-09 01:29:12,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:29:12,532 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 425 transitions. [2024-11-09 01:29:12,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 01:29:12,532 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 425 transitions. [2024-11-09 01:29:12,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-09 01:29:12,533 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:29:12,533 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:29:12,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-09 01:29:12,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:29:12,734 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:29:12,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:29:12,734 INFO L85 PathProgramCache]: Analyzing trace with hash 324002169, now seen corresponding path program 1 times [2024-11-09 01:29:12,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:29:12,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1927861703] [2024-11-09 01:29:12,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:29:12,735 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:29:12,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:29:12,736 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:29:12,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-09 01:29:13,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:29:13,086 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 01:29:13,089 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:29:13,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-09 01:29:13,366 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 15 treesize of output 7 [2024-11-09 01:29:13,389 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 78 proven. 9 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-11-09 01:29:13,390 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:29:13,910 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 39 treesize of output 27 [2024-11-09 01:29:13,979 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:29:13,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1927861703] [2024-11-09 01:29:13,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1927861703] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:29:13,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1526890799] [2024-11-09 01:29:13,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:29:13,980 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 01:29:13,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-09 01:29:13,983 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 01:29:13,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2024-11-09 01:29:15,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:29:15,172 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 01:29:15,174 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:29:15,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-09 01:29:15,352 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 15 treesize of output 7 [2024-11-09 01:29:15,357 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 78 proven. 9 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-11-09 01:29:15,357 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:29:15,659 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 39 treesize of output 27 [2024-11-09 01:29:15,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1526890799] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:29:15,702 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 01:29:15,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2024-11-09 01:29:15,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391986073] [2024-11-09 01:29:15,702 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 01:29:15,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 01:29:15,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:29:15,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 01:29:15,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2024-11-09 01:29:15,703 INFO L87 Difference]: Start difference. First operand 306 states and 425 transitions. Second operand has 10 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-09 01:29:16,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:29:16,298 INFO L93 Difference]: Finished difference Result 814 states and 1124 transitions. [2024-11-09 01:29:16,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 01:29:16,299 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 96 [2024-11-09 01:29:16,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:29:16,301 INFO L225 Difference]: With dead ends: 814 [2024-11-09 01:29:16,302 INFO L226 Difference]: Without dead ends: 511 [2024-11-09 01:29:16,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 281 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=195, Invalid=561, Unknown=0, NotChecked=0, Total=756 [2024-11-09 01:29:16,303 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 161 mSDsluCounter, 723 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 01:29:16,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 816 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 01:29:16,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2024-11-09 01:29:16,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 381. [2024-11-09 01:29:16,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 339 states have (on average 1.3333333333333333) internal successors, (452), 339 states have internal predecessors, (452), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-09 01:29:16,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 524 transitions. [2024-11-09 01:29:16,323 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 524 transitions. Word has length 96 [2024-11-09 01:29:16,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:29:16,324 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 524 transitions. [2024-11-09 01:29:16,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-09 01:29:16,324 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 524 transitions. [2024-11-09 01:29:16,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-09 01:29:16,325 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:29:16,325 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:29:16,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Forceful destruction successful, exit code 0 [2024-11-09 01:29:16,539 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-09 01:29:16,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:29:16,726 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:29:16,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:29:16,727 INFO L85 PathProgramCache]: Analyzing trace with hash 542856887, now seen corresponding path program 1 times [2024-11-09 01:29:16,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:29:16,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1843781269] [2024-11-09 01:29:16,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:29:16,728 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:29:16,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:29:16,729 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:29:16,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-09 01:29:17,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:29:17,086 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 01:29:17,088 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:29:17,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-09 01:29:17,352 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 15 treesize of output 7 [2024-11-09 01:29:17,384 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 78 proven. 9 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-11-09 01:29:17,384 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:29:17,485 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:29:17,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1843781269] [2024-11-09 01:29:17,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1843781269] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:29:17,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1136187812] [2024-11-09 01:29:17,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:29:17,486 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 01:29:17,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-09 01:29:17,487 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 01:29:17,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2024-11-09 01:29:18,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:29:18,622 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 01:29:18,625 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:29:18,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 9 treesize of output 3 [2024-11-09 01:29:18,910 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 15 treesize of output 7 [2024-11-09 01:29:18,916 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 78 proven. 9 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-11-09 01:29:18,917 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:29:19,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1136187812] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:29:19,002 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 01:29:19,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2024-11-09 01:29:19,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386088419] [2024-11-09 01:29:19,002 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 01:29:19,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 01:29:19,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:29:19,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 01:29:19,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-09 01:29:19,003 INFO L87 Difference]: Start difference. First operand 381 states and 524 transitions. Second operand has 10 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-09 01:29:19,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:29:19,674 INFO L93 Difference]: Finished difference Result 814 states and 1120 transitions. [2024-11-09 01:29:19,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 01:29:19,675 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 96 [2024-11-09 01:29:19,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:29:19,677 INFO L225 Difference]: With dead ends: 814 [2024-11-09 01:29:19,677 INFO L226 Difference]: Without dead ends: 511 [2024-11-09 01:29:19,678 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 237 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=130, Invalid=422, Unknown=0, NotChecked=0, Total=552 [2024-11-09 01:29:19,679 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 154 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:29:19,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 819 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 01:29:19,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2024-11-09 01:29:19,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 381. [2024-11-09 01:29:19,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 339 states have (on average 1.3333333333333333) internal successors, (452), 339 states have internal predecessors, (452), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-09 01:29:19,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 524 transitions. [2024-11-09 01:29:19,712 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 524 transitions. Word has length 96 [2024-11-09 01:29:19,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:29:19,715 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 524 transitions. [2024-11-09 01:29:19,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-09 01:29:19,715 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 524 transitions. [2024-11-09 01:29:19,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-09 01:29:19,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:29:19,716 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:29:19,730 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-09 01:29:19,933 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Ended with exit code 0 [2024-11-09 01:29:20,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-09 01:29:20,121 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:29:20,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:29:20,121 INFO L85 PathProgramCache]: Analyzing trace with hash 637583710, now seen corresponding path program 1 times [2024-11-09 01:29:20,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:29:20,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1115158278] [2024-11-09 01:29:20,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:29:20,122 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:29:20,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:29:20,123 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:29:20,124 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