./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_1251b.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 Calling Ultimate with: /usr/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/float-newlib/double_req_bl_1251b.c -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.graphml --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 0ddb7cbdb5243e0dc5a18ffa5957d423189625fe9ffc6441855806502cce15ab --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 14:13:07,811 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 14:13:07,813 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 14:13:07,841 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 14:13:07,842 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 14:13:07,843 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 14:13:07,844 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 14:13:07,845 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 14:13:07,847 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 14:13:07,847 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 14:13:07,848 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 14:13:07,849 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 14:13:07,849 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 14:13:07,850 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 14:13:07,851 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 14:13:07,852 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 14:13:07,853 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 14:13:07,853 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 14:13:07,855 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 14:13:07,856 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 14:13:07,858 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 14:13:07,862 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 14:13:07,863 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 14:13:07,864 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 14:13:07,865 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 14:13:07,868 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 14:13:07,874 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 14:13:07,874 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 14:13:07,875 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 14:13:07,876 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 14:13:07,876 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 14:13:07,877 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 14:13:07,877 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 14:13:07,878 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 14:13:07,878 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 14:13:07,880 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 14:13:07,881 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 14:13:07,881 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 14:13:07,882 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 14:13:07,883 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 14:13:07,883 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 14:13:07,884 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 14:13:07,886 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 14:13:07,912 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 14:13:07,919 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 14:13:07,919 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 14:13:07,920 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 14:13:07,920 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 14:13:07,920 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 14:13:07,921 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 14:13:07,921 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 14:13:07,921 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 14:13:07,922 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 14:13:07,922 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 14:13:07,922 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 14:13:07,923 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 14:13:07,923 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 14:13:07,923 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 14:13:07,923 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 14:13:07,923 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 14:13:07,924 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 14:13:07,924 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 14:13:07,924 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 14:13:07,924 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 14:13:07,924 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 14:13:07,925 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 14:13:07,925 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 14:13:07,925 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 14:13:07,925 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 14:13:07,925 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 14:13:07,926 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 14:13:07,926 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 14:13:07,926 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 14:13:07,926 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 14:13:07,926 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 14:13:07,927 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 14:13:07,927 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.graphml 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 -> 0ddb7cbdb5243e0dc5a18ffa5957d423189625fe9ffc6441855806502cce15ab [2022-07-19 14:13:08,135 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 14:13:08,166 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 14:13:08,168 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 14:13:08,169 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 14:13:08,170 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 14:13:08,171 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1251b.c [2022-07-19 14:13:08,222 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b25dfcaa/2200236c942a419bbee00ca8f753e70f/FLAG10b692230 [2022-07-19 14:13:08,608 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 14:13:08,608 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1251b.c [2022-07-19 14:13:08,613 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b25dfcaa/2200236c942a419bbee00ca8f753e70f/FLAG10b692230 [2022-07-19 14:13:09,012 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b25dfcaa/2200236c942a419bbee00ca8f753e70f [2022-07-19 14:13:09,014 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 14:13:09,015 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 14:13:09,017 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 14:13:09,017 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 14:13:09,021 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 14:13:09,021 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 02:13:09" (1/1) ... [2022-07-19 14:13:09,022 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@406a172a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:13:09, skipping insertion in model container [2022-07-19 14:13:09,022 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 02:13:09" (1/1) ... [2022-07-19 14:13:09,028 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 14:13:09,041 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 14:13:09,190 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1251b.c[2080,2093] [2022-07-19 14:13:09,193 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:13:09,198 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 14:13:09,214 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1251b.c[2080,2093] [2022-07-19 14:13:09,215 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:13:09,226 INFO L208 MainTranslator]: Completed translation [2022-07-19 14:13:09,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:13:09 WrapperNode [2022-07-19 14:13:09,227 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 14:13:09,231 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 14:13:09,232 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 14:13:09,232 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 14:13:09,237 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:13:09" (1/1) ... [2022-07-19 14:13:09,244 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:13:09" (1/1) ... [2022-07-19 14:13:09,259 INFO L137 Inliner]: procedures = 18, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 52 [2022-07-19 14:13:09,260 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 14:13:09,260 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 14:13:09,260 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 14:13:09,261 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 14:13:09,265 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:13:09" (1/1) ... [2022-07-19 14:13:09,265 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:13:09" (1/1) ... [2022-07-19 14:13:09,267 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:13:09" (1/1) ... [2022-07-19 14:13:09,267 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:13:09" (1/1) ... [2022-07-19 14:13:09,272 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:13:09" (1/1) ... [2022-07-19 14:13:09,275 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:13:09" (1/1) ... [2022-07-19 14:13:09,276 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:13:09" (1/1) ... [2022-07-19 14:13:09,278 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 14:13:09,279 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 14:13:09,279 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 14:13:09,279 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 14:13:09,280 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:13:09" (1/1) ... [2022-07-19 14:13:09,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 14:13:09,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:13:09,315 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-19 14:13:09,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-19 14:13:09,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 14:13:09,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 14:13:09,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 14:13:09,343 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2022-07-19 14:13:09,343 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2022-07-19 14:13:09,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-07-19 14:13:09,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 14:13:09,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 14:13:09,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 14:13:09,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 14:13:09,408 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 14:13:09,409 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 14:13:09,523 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 14:13:09,528 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 14:13:09,528 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-19 14:13:09,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:13:09 BoogieIcfgContainer [2022-07-19 14:13:09,530 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 14:13:09,531 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 14:13:09,531 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 14:13:09,553 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 14:13:09,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 02:13:09" (1/3) ... [2022-07-19 14:13:09,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@737fd34d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 02:13:09, skipping insertion in model container [2022-07-19 14:13:09,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:13:09" (2/3) ... [2022-07-19 14:13:09,555 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@737fd34d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 02:13:09, skipping insertion in model container [2022-07-19 14:13:09,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:13:09" (3/3) ... [2022-07-19 14:13:09,556 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_1251b.c [2022-07-19 14:13:09,567 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 14:13:09,567 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 14:13:09,619 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 14:13:09,638 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@27f39d3, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7ab35787 [2022-07-19 14:13:09,639 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 14:13:09,642 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 24 states have (on average 1.5) internal successors, (36), 25 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 14:13:09,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-19 14:13:09,649 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:13:09,649 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:13:09,650 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:13:09,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:13:09,654 INFO L85 PathProgramCache]: Analyzing trace with hash 87468236, now seen corresponding path program 1 times [2022-07-19 14:13:09,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:13:09,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359293224] [2022-07-19 14:13:09,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:13:09,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:13:09,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:13:09,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 14:13:09,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:13:09,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:13:09,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:13:09,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359293224] [2022-07-19 14:13:09,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359293224] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:13:09,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:13:09,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 14:13:09,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503986224] [2022-07-19 14:13:09,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:13:09,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 14:13:09,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:13:09,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 14:13:09,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 14:13:09,825 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.5) internal successors, (36), 25 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 14:13:09,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:13:09,873 INFO L93 Difference]: Finished difference Result 53 states and 75 transitions. [2022-07-19 14:13:09,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 14:13:09,876 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-07-19 14:13:09,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:13:09,881 INFO L225 Difference]: With dead ends: 53 [2022-07-19 14:13:09,881 INFO L226 Difference]: Without dead ends: 25 [2022-07-19 14:13:09,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 14:13:09,888 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 1 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:13:09,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 68 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:13:09,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-07-19 14:13:09,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-07-19 14:13:09,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 14:13:09,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2022-07-19 14:13:09,917 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 15 [2022-07-19 14:13:09,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:13:09,917 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-07-19 14:13:09,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 14:13:09,918 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-07-19 14:13:09,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-19 14:13:09,919 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:13:09,919 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:13:09,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 14:13:09,920 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:13:09,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:13:09,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1072117413, now seen corresponding path program 1 times [2022-07-19 14:13:09,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:13:09,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157160413] [2022-07-19 14:13:09,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:13:09,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:13:09,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:13:10,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 14:13:10,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:13:10,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:13:10,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:13:10,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157160413] [2022-07-19 14:13:10,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157160413] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:13:10,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:13:10,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 14:13:10,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489928253] [2022-07-19 14:13:10,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:13:10,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 14:13:10,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:13:10,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 14:13:10,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 14:13:10,082 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 14:13:10,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:13:10,125 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2022-07-19 14:13:10,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 14:13:10,126 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-07-19 14:13:10,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:13:10,129 INFO L225 Difference]: With dead ends: 33 [2022-07-19 14:13:10,129 INFO L226 Difference]: Without dead ends: 29 [2022-07-19 14:13:10,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 14:13:10,130 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:13:10,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 103 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:13:10,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-19 14:13:10,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-07-19 14:13:10,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 14:13:10,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2022-07-19 14:13:10,145 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 16 [2022-07-19 14:13:10,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:13:10,146 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2022-07-19 14:13:10,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 14:13:10,147 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2022-07-19 14:13:10,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-19 14:13:10,147 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:13:10,147 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:13:10,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 14:13:10,148 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:13:10,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:13:10,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1361378825, now seen corresponding path program 1 times [2022-07-19 14:13:10,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:13:10,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385467269] [2022-07-19 14:13:10,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:13:10,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:13:10,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:13:10,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 14:13:10,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:13:10,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:13:10,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:13:10,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385467269] [2022-07-19 14:13:10,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385467269] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:13:10,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:13:10,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 14:13:10,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426286225] [2022-07-19 14:13:10,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:13:10,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 14:13:10,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:13:10,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 14:13:10,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 14:13:10,282 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 14:13:10,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:13:10,328 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-07-19 14:13:10,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 14:13:10,329 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-07-19 14:13:10,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:13:10,330 INFO L225 Difference]: With dead ends: 37 [2022-07-19 14:13:10,332 INFO L226 Difference]: Without dead ends: 33 [2022-07-19 14:13:10,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 14:13:10,334 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 1 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:13:10,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 119 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:13:10,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-07-19 14:13:10,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2022-07-19 14:13:10,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 14:13:10,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2022-07-19 14:13:10,347 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 17 [2022-07-19 14:13:10,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:13:10,347 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2022-07-19 14:13:10,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 14:13:10,348 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2022-07-19 14:13:10,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-19 14:13:10,349 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:13:10,349 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:13:10,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 14:13:10,350 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:13:10,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:13:10,351 INFO L85 PathProgramCache]: Analyzing trace with hash -2128342377, now seen corresponding path program 1 times [2022-07-19 14:13:10,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:13:10,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909705093] [2022-07-19 14:13:10,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:13:10,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:13:10,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:13:10,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 14:13:10,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:13:10,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:13:10,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:13:10,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909705093] [2022-07-19 14:13:10,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909705093] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:13:10,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:13:10,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 14:13:10,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058587059] [2022-07-19 14:13:10,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:13:10,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 14:13:10,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:13:10,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 14:13:10,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 14:13:10,469 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 14:13:10,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:13:10,513 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-07-19 14:13:10,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 14:13:10,514 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-07-19 14:13:10,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:13:10,515 INFO L225 Difference]: With dead ends: 37 [2022-07-19 14:13:10,516 INFO L226 Difference]: Without dead ends: 33 [2022-07-19 14:13:10,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 14:13:10,518 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 1 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:13:10,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 119 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:13:10,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-07-19 14:13:10,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2022-07-19 14:13:10,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 14:13:10,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2022-07-19 14:13:10,531 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 18 [2022-07-19 14:13:10,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:13:10,531 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2022-07-19 14:13:10,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 14:13:10,532 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2022-07-19 14:13:10,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-19 14:13:10,533 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:13:10,533 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:13:10,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 14:13:10,533 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:13:10,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:13:10,534 INFO L85 PathProgramCache]: Analyzing trace with hash -259243195, now seen corresponding path program 1 times [2022-07-19 14:13:10,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:13:10,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117871954] [2022-07-19 14:13:10,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:13:10,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:13:10,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:13:10,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 14:13:10,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:13:10,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:13:10,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:13:10,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117871954] [2022-07-19 14:13:10,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117871954] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:13:10,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:13:10,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 14:13:10,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599875158] [2022-07-19 14:13:10,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:13:10,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 14:13:10,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:13:10,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 14:13:10,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 14:13:10,652 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 14:13:10,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:13:10,684 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-07-19 14:13:10,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 14:13:10,687 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-07-19 14:13:10,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:13:10,688 INFO L225 Difference]: With dead ends: 37 [2022-07-19 14:13:10,688 INFO L226 Difference]: Without dead ends: 33 [2022-07-19 14:13:10,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 14:13:10,690 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 1 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:13:10,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 119 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:13:10,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-07-19 14:13:10,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2022-07-19 14:13:10,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 14:13:10,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2022-07-19 14:13:10,702 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 19 [2022-07-19 14:13:10,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:13:10,703 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2022-07-19 14:13:10,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 14:13:10,703 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2022-07-19 14:13:10,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-19 14:13:10,704 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:13:10,704 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:13:10,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-19 14:13:10,705 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:13:10,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:13:10,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1483567140, now seen corresponding path program 1 times [2022-07-19 14:13:10,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:13:10,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85332364] [2022-07-19 14:13:10,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:13:10,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:13:10,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 14:13:10,741 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-19 14:13:10,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 14:13:10,790 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-19 14:13:10,790 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-19 14:13:10,791 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-19 14:13:10,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-19 14:13:10,795 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-07-19 14:13:10,798 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 14:13:10,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 02:13:10 BoogieIcfgContainer [2022-07-19 14:13:10,827 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 14:13:10,827 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 14:13:10,827 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 14:13:10,827 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 14:13:10,828 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:13:09" (3/4) ... [2022-07-19 14:13:10,830 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-19 14:13:10,830 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 14:13:10,830 INFO L158 Benchmark]: Toolchain (without parser) took 1815.34ms. Allocated memory is still 113.2MB. Free memory was 77.8MB in the beginning and 50.3MB in the end (delta: 27.5MB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. [2022-07-19 14:13:10,831 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 113.2MB. Free memory is still 93.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 14:13:10,831 INFO L158 Benchmark]: CACSL2BoogieTranslator took 210.68ms. Allocated memory is still 113.2MB. Free memory was 77.6MB in the beginning and 88.4MB in the end (delta: -10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-19 14:13:10,833 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.39ms. Allocated memory is still 113.2MB. Free memory was 88.4MB in the beginning and 86.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 14:13:10,833 INFO L158 Benchmark]: Boogie Preprocessor took 18.07ms. Allocated memory is still 113.2MB. Free memory was 86.9MB in the beginning and 85.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 14:13:10,834 INFO L158 Benchmark]: RCFGBuilder took 251.14ms. Allocated memory is still 113.2MB. Free memory was 85.4MB in the beginning and 73.8MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-19 14:13:10,834 INFO L158 Benchmark]: TraceAbstraction took 1295.33ms. Allocated memory is still 113.2MB. Free memory was 73.5MB in the beginning and 50.8MB in the end (delta: 22.7MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. [2022-07-19 14:13:10,834 INFO L158 Benchmark]: Witness Printer took 2.84ms. Allocated memory is still 113.2MB. Free memory is still 50.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 14:13:10,836 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 113.2MB. Free memory is still 93.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 210.68ms. Allocated memory is still 113.2MB. Free memory was 77.6MB in the beginning and 88.4MB in the end (delta: -10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.39ms. Allocated memory is still 113.2MB. Free memory was 88.4MB in the beginning and 86.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 18.07ms. Allocated memory is still 113.2MB. Free memory was 86.9MB in the beginning and 85.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 251.14ms. Allocated memory is still 113.2MB. Free memory was 85.4MB in the beginning and 73.8MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1295.33ms. Allocated memory is still 113.2MB. Free memory was 73.5MB in the beginning and 50.8MB in the end (delta: 22.7MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. * Witness Printer took 2.84ms. Allocated memory is still 113.2MB. Free memory is still 50.3MB. 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: 80]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 79, overapproximation of someBinaryArithmeticDOUBLEoperation at line 67. Possible FailurePath: [L66] double x = __VERIFIER_nondet_double(); [L67] double y = 0.0 / 0.0; [L74] CALL, EXPR isnan_double(x) [L18] return x != x; VAL [\old(x)=4294967299, \result=0, x=4294967299] [L74] RET, EXPR isnan_double(x) [L74] COND TRUE !isnan_double(x) [L76] CALL, EXPR fmax_double(x, y) [L57] CALL, EXPR __fpclassify_double(x) VAL [\old(x)=4294967299] [L29] __uint32_t msw, lsw; VAL [\old(x)=4294967299, x=4294967299] [L32] ieee_double_shape_type ew_u; [L33] ew_u.value = (x) [L34] EXPR ew_u.parts.msw [L34] (msw) = ew_u.parts.msw [L35] EXPR ew_u.parts.lsw [L35] (lsw) = ew_u.parts.lsw [L38-L39] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) VAL [\old(x)=4294967299, lsw=4294967297, msw=4293918721, x=4294967299] [L41-L42] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) VAL [\old(x)=4294967299, lsw=4294967297, msw=4293918721, x=4294967299] [L44-L45] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) VAL [\old(x)=4294967299, lsw=4294967297, msw=4293918721, x=4294967299] [L48-L49] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L52] return 0; VAL [\old(x)=4294967299, \result=0, lsw=4294967297, msw=4293918721, x=4294967299] [L57] RET, EXPR __fpclassify_double(x) VAL [\old(x)=4294967299, \old(y)=4294967298, __fpclassify_double(x)=0, x=4294967299, y=4294967298] [L57] COND TRUE __fpclassify_double(x) == 0 [L58] return y; VAL [\old(x)=4294967299, \old(y)=4294967298, \result=4294967298, x=4294967299, y=4294967298] [L76] RET, EXPR fmax_double(x, y) [L76] double res = fmax_double(x, y); [L79] COND TRUE res != x VAL [res=4294967298, x=4294967299, y=4294967298] [L80] reach_error() VAL [res=4294967298, x=4294967299, y=4294967298] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5 mSDsluCounter, 528 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 361 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 90 IncrementalHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 167 mSDtfsCounter, 90 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=0, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 12 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 104 NumberOfCodeBlocks, 104 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 80 ConstructedInterpolants, 0 QuantifiedInterpolants, 212 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 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 [2022-07-19 14:13:10,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/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/float-newlib/double_req_bl_1251b.c -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.graphml --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 0ddb7cbdb5243e0dc5a18ffa5957d423189625fe9ffc6441855806502cce15ab --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 14:13:12,698 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 14:13:12,703 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 14:13:12,738 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 14:13:12,738 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 14:13:12,739 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 14:13:12,740 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 14:13:12,742 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 14:13:12,744 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 14:13:12,748 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 14:13:12,749 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 14:13:12,752 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 14:13:12,752 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 14:13:12,754 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 14:13:12,756 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 14:13:12,759 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 14:13:12,760 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 14:13:12,761 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 14:13:12,763 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 14:13:12,766 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 14:13:12,769 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 14:13:12,770 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 14:13:12,771 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 14:13:12,772 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 14:13:12,773 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 14:13:12,776 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 14:13:12,782 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 14:13:12,782 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 14:13:12,783 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 14:13:12,783 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 14:13:12,784 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 14:13:12,785 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 14:13:12,786 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 14:13:12,786 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 14:13:12,787 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 14:13:12,789 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 14:13:12,789 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 14:13:12,789 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 14:13:12,790 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 14:13:12,790 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 14:13:12,790 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 14:13:12,791 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 14:13:12,792 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-19 14:13:12,818 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 14:13:12,818 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 14:13:12,819 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 14:13:12,819 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 14:13:12,820 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 14:13:12,820 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 14:13:12,820 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 14:13:12,821 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 14:13:12,821 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 14:13:12,822 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 14:13:12,822 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 14:13:12,822 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 14:13:12,822 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 14:13:12,822 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 14:13:12,832 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 14:13:12,832 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 14:13:12,832 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-19 14:13:12,832 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-19 14:13:12,832 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-19 14:13:12,833 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 14:13:12,833 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 14:13:12,833 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 14:13:12,833 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 14:13:12,833 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 14:13:12,834 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 14:13:12,834 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 14:13:12,834 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 14:13:12,834 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 14:13:12,835 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 14:13:12,835 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 14:13:12,835 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-19 14:13:12,835 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-19 14:13:12,836 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 14:13:12,836 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 14:13:12,836 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 14:13:12,836 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-19 14:13:12,836 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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.graphml 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 -> 0ddb7cbdb5243e0dc5a18ffa5957d423189625fe9ffc6441855806502cce15ab [2022-07-19 14:13:13,116 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 14:13:13,134 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 14:13:13,137 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 14:13:13,137 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 14:13:13,138 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 14:13:13,139 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1251b.c [2022-07-19 14:13:13,192 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/971b24c92/41d3b776662741dc8648a97f7576bce7/FLAG115825373 [2022-07-19 14:13:13,637 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 14:13:13,638 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1251b.c [2022-07-19 14:13:13,644 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/971b24c92/41d3b776662741dc8648a97f7576bce7/FLAG115825373 [2022-07-19 14:13:13,662 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/971b24c92/41d3b776662741dc8648a97f7576bce7 [2022-07-19 14:13:13,665 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 14:13:13,666 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 14:13:13,668 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 14:13:13,668 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 14:13:13,671 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 14:13:13,672 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 02:13:13" (1/1) ... [2022-07-19 14:13:13,673 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66771122 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:13:13, skipping insertion in model container [2022-07-19 14:13:13,673 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 02:13:13" (1/1) ... [2022-07-19 14:13:13,679 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 14:13:13,698 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 14:13:13,843 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1251b.c[2080,2093] [2022-07-19 14:13:13,851 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:13:13,891 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 14:13:13,936 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1251b.c[2080,2093] [2022-07-19 14:13:13,942 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:13:13,957 INFO L208 MainTranslator]: Completed translation [2022-07-19 14:13:13,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:13:13 WrapperNode [2022-07-19 14:13:13,959 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 14:13:13,960 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 14:13:13,960 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 14:13:13,961 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 14:13:13,966 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:13:13" (1/1) ... [2022-07-19 14:13:13,982 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:13:13" (1/1) ... [2022-07-19 14:13:14,000 INFO L137 Inliner]: procedures = 21, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 50 [2022-07-19 14:13:14,001 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 14:13:14,002 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 14:13:14,002 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 14:13:14,002 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 14:13:14,009 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:13:13" (1/1) ... [2022-07-19 14:13:14,009 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:13:13" (1/1) ... [2022-07-19 14:13:14,018 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:13:13" (1/1) ... [2022-07-19 14:13:14,019 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:13:13" (1/1) ... [2022-07-19 14:13:14,035 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:13:13" (1/1) ... [2022-07-19 14:13:14,038 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:13:13" (1/1) ... [2022-07-19 14:13:14,039 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:13:13" (1/1) ... [2022-07-19 14:13:14,042 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 14:13:14,042 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 14:13:14,043 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 14:13:14,043 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 14:13:14,043 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:13:13" (1/1) ... [2022-07-19 14:13:14,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 14:13:14,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:13:14,067 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-19 14:13:14,111 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 14:13:14,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2022-07-19 14:13:14,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-19 14:13:14,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 14:13:14,112 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2022-07-19 14:13:14,112 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2022-07-19 14:13:14,112 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-19 14:13:14,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 14:13:14,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 14:13:14,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 14:13:14,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-19 14:13:14,199 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 14:13:14,203 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 14:13:14,391 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 14:13:14,396 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 14:13:14,396 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-19 14:13:14,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:13:14 BoogieIcfgContainer [2022-07-19 14:13:14,411 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 14:13:14,413 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 14:13:14,413 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 14:13:14,417 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 14:13:14,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 02:13:13" (1/3) ... [2022-07-19 14:13:14,418 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b36296e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 02:13:14, skipping insertion in model container [2022-07-19 14:13:14,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:13:13" (2/3) ... [2022-07-19 14:13:14,418 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b36296e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 02:13:14, skipping insertion in model container [2022-07-19 14:13:14,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:13:14" (3/3) ... [2022-07-19 14:13:14,419 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_1251b.c [2022-07-19 14:13:14,431 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 14:13:14,431 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 14:13:14,496 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 14:13:14,505 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@d446a7, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3597d1b6 [2022-07-19 14:13:14,505 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 14:13:14,508 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 14:13:14,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-19 14:13:14,517 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:13:14,518 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:13:14,518 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:13:14,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:13:14,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1684133472, now seen corresponding path program 1 times [2022-07-19 14:13:14,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:13:14,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [697116623] [2022-07-19 14:13:14,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:13:14,535 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:13:14,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:13:14,573 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:13:14,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-19 14:13:14,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:13:14,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-19 14:13:14,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:13:14,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:13:14,711 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:13:14,711 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:13:14,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [697116623] [2022-07-19 14:13:14,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [697116623] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:13:14,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:13:14,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 14:13:14,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087102770] [2022-07-19 14:13:14,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:13:14,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-19 14:13:14,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:13:14,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-19 14:13:14,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 14:13:14,751 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 14:13:14,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:13:14,776 INFO L93 Difference]: Finished difference Result 49 states and 71 transitions. [2022-07-19 14:13:14,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-19 14:13:14,777 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-07-19 14:13:14,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:13:14,783 INFO L225 Difference]: With dead ends: 49 [2022-07-19 14:13:14,783 INFO L226 Difference]: Without dead ends: 23 [2022-07-19 14:13:14,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 14:13:14,795 INFO L413 NwaCegarLoop]: 35 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, 35 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 [2022-07-19 14:13:14,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:13:14,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-07-19 14:13:14,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-07-19 14:13:14,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 14:13:14,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2022-07-19 14:13:14,831 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 14 [2022-07-19 14:13:14,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:13:14,832 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2022-07-19 14:13:14,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 14:13:14,832 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2022-07-19 14:13:14,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-19 14:13:14,834 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:13:14,834 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:13:14,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-19 14:13:15,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:13:15,044 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:13:15,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:13:15,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1014515731, now seen corresponding path program 1 times [2022-07-19 14:13:15,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:13:15,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1317299812] [2022-07-19 14:13:15,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:13:15,046 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:13:15,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:13:15,048 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:13:15,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-19 14:13:15,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:13:15,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 14:13:15,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:13:15,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:13:15,141 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:13:15,142 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:13:15,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1317299812] [2022-07-19 14:13:15,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1317299812] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:13:15,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:13:15,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:13:15,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976471604] [2022-07-19 14:13:15,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:13:15,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:13:15,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:13:15,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:13:15,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:13:15,145 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 14:13:15,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:13:15,250 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2022-07-19 14:13:15,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:13:15,252 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-07-19 14:13:15,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:13:15,254 INFO L225 Difference]: With dead ends: 30 [2022-07-19 14:13:15,254 INFO L226 Difference]: Without dead ends: 26 [2022-07-19 14:13:15,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:13:15,255 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:13:15,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 14:13:15,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-07-19 14:13:15,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-07-19 14:13:15,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 14:13:15,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2022-07-19 14:13:15,262 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 15 [2022-07-19 14:13:15,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:13:15,263 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2022-07-19 14:13:15,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 14:13:15,263 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2022-07-19 14:13:15,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-19 14:13:15,264 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:13:15,264 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:13:15,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-19 14:13:15,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:13:15,475 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:13:15,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:13:15,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1185853373, now seen corresponding path program 1 times [2022-07-19 14:13:15,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:13:15,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [919431148] [2022-07-19 14:13:15,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:13:15,477 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:13:15,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:13:15,478 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:13:15,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-19 14:13:15,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:13:15,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 14:13:15,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:13:15,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:13:15,582 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:13:15,582 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:13:15,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [919431148] [2022-07-19 14:13:15,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [919431148] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:13:15,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:13:15,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:13:15,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539444527] [2022-07-19 14:13:15,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:13:15,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:13:15,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:13:15,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:13:15,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:13:15,584 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 14:13:15,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:13:15,653 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2022-07-19 14:13:15,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:13:15,653 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-07-19 14:13:15,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:13:15,654 INFO L225 Difference]: With dead ends: 33 [2022-07-19 14:13:15,654 INFO L226 Difference]: Without dead ends: 29 [2022-07-19 14:13:15,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:13:15,656 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:13:15,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 14:13:15,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-19 14:13:15,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2022-07-19 14:13:15,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 14:13:15,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2022-07-19 14:13:15,661 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 16 [2022-07-19 14:13:15,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:13:15,662 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2022-07-19 14:13:15,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 14:13:15,662 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2022-07-19 14:13:15,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-19 14:13:15,663 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:13:15,663 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:13:15,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-19 14:13:15,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:13:15,864 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:13:15,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:13:15,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1347661745, now seen corresponding path program 1 times [2022-07-19 14:13:15,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:13:15,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [672863497] [2022-07-19 14:13:15,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:13:15,865 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:13:15,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:13:15,871 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:13:15,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-19 14:13:15,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:13:15,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 14:13:15,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:13:15,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:13:15,952 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:13:15,952 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:13:15,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [672863497] [2022-07-19 14:13:15,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [672863497] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:13:15,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:13:15,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:13:15,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038575912] [2022-07-19 14:13:15,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:13:15,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:13:15,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:13:15,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:13:15,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:13:15,955 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 14:13:16,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:13:16,338 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2022-07-19 14:13:16,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:13:16,339 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-07-19 14:13:16,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:13:16,340 INFO L225 Difference]: With dead ends: 33 [2022-07-19 14:13:16,340 INFO L226 Difference]: Without dead ends: 29 [2022-07-19 14:13:16,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:13:16,341 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 14:13:16,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-19 14:13:16,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-19 14:13:16,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2022-07-19 14:13:16,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 14:13:16,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2022-07-19 14:13:16,347 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 17 [2022-07-19 14:13:16,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:13:16,347 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2022-07-19 14:13:16,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 14:13:16,348 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2022-07-19 14:13:16,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-19 14:13:16,348 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:13:16,348 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:13:16,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-19 14:13:16,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:13:16,549 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:13:16,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:13:16,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1832266503, now seen corresponding path program 1 times [2022-07-19 14:13:16,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:13:16,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1369706864] [2022-07-19 14:13:16,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:13:16,551 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:13:16,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:13:16,552 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:13:16,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-19 14:13:16,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:13:16,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 14:13:16,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:13:16,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:13:16,648 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:13:16,648 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:13:16,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1369706864] [2022-07-19 14:13:16,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1369706864] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:13:16,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:13:16,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:13:16,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300346889] [2022-07-19 14:13:16,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:13:16,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:13:16,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:13:16,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:13:16,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:13:16,651 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 14:13:16,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:13:16,746 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2022-07-19 14:13:16,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:13:16,747 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-07-19 14:13:16,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:13:16,748 INFO L225 Difference]: With dead ends: 33 [2022-07-19 14:13:16,748 INFO L226 Difference]: Without dead ends: 29 [2022-07-19 14:13:16,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:13:16,749 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:13:16,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 14:13:16,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-19 14:13:16,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2022-07-19 14:13:16,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 14:13:16,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2022-07-19 14:13:16,754 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 18 [2022-07-19 14:13:16,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:13:16,755 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2022-07-19 14:13:16,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 14:13:16,755 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2022-07-19 14:13:16,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-19 14:13:16,756 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:13:16,756 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:13:16,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-19 14:13:16,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:13:16,968 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:13:16,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:13:16,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1575197112, now seen corresponding path program 1 times [2022-07-19 14:13:16,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:13:16,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [54620522] [2022-07-19 14:13:16,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:13:16,969 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:13:16,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:13:16,971 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:13:16,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-19 14:13:17,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:13:17,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-19 14:13:17,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:13:18,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:13:18,209 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:13:18,209 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:13:18,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [54620522] [2022-07-19 14:13:18,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [54620522] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:13:18,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:13:18,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-19 14:13:18,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065041308] [2022-07-19 14:13:18,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:13:18,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 14:13:18,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:13:18,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 14:13:18,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-19 14:13:18,212 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 14:13:18,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:13:18,689 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2022-07-19 14:13:18,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 14:13:18,690 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-07-19 14:13:18,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:13:18,690 INFO L225 Difference]: With dead ends: 45 [2022-07-19 14:13:18,690 INFO L226 Difference]: Without dead ends: 25 [2022-07-19 14:13:18,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-07-19 14:13:18,692 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 21 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 29 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 14:13:18,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 96 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 30 Invalid, 0 Unknown, 29 Unchecked, 0.4s Time] [2022-07-19 14:13:18,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-07-19 14:13:18,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-07-19 14:13:18,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-19 14:13:18,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2022-07-19 14:13:18,696 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 18 [2022-07-19 14:13:18,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:13:18,697 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2022-07-19 14:13:18,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 14:13:18,697 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-07-19 14:13:18,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-19 14:13:18,698 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:13:18,698 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:13:18,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-19 14:13:18,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:13:18,899 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:13:18,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:13:18,899 INFO L85 PathProgramCache]: Analyzing trace with hash 789982401, now seen corresponding path program 1 times [2022-07-19 14:13:18,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:13:18,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [256549171] [2022-07-19 14:13:18,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:13:18,900 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:13:18,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:13:18,903 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:13:18,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-19 14:13:18,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:13:18,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 14:13:18,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:13:19,002 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 14:13:19,003 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:13:19,003 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:13:19,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [256549171] [2022-07-19 14:13:19,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [256549171] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:13:19,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:13:19,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:13:19,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018133633] [2022-07-19 14:13:19,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:13:19,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:13:19,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:13:19,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:13:19,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:13:19,005 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 14:13:19,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:13:19,278 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2022-07-19 14:13:19,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:13:19,279 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2022-07-19 14:13:19,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:13:19,280 INFO L225 Difference]: With dead ends: 32 [2022-07-19 14:13:19,280 INFO L226 Difference]: Without dead ends: 28 [2022-07-19 14:13:19,281 INFO L412 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 [2022-07-19 14:13:19,281 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 14:13:19,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 14:13:19,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-19 14:13:19,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-07-19 14:13:19,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 14:13:19,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2022-07-19 14:13:19,286 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 23 [2022-07-19 14:13:19,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:13:19,286 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2022-07-19 14:13:19,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 14:13:19,286 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2022-07-19 14:13:19,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-19 14:13:19,287 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:13:19,288 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:13:19,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-19 14:13:19,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:13:19,488 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:13:19,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:13:19,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1141759769, now seen corresponding path program 1 times [2022-07-19 14:13:19,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:13:19,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [92846338] [2022-07-19 14:13:19,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:13:19,489 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:13:19,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:13:19,490 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:13:19,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-19 14:13:19,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:13:19,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 14:13:19,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:13:19,593 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 14:13:19,594 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:13:19,594 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:13:19,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [92846338] [2022-07-19 14:13:19,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [92846338] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:13:19,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:13:19,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:13:19,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912937452] [2022-07-19 14:13:19,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:13:19,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:13:19,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:13:19,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:13:19,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:13:19,596 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 14:13:19,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:13:19,715 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2022-07-19 14:13:19,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:13:19,719 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-07-19 14:13:19,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:13:19,720 INFO L225 Difference]: With dead ends: 35 [2022-07-19 14:13:19,720 INFO L226 Difference]: Without dead ends: 31 [2022-07-19 14:13:19,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:13:19,721 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:13:19,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 14:13:19,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-19 14:13:19,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2022-07-19 14:13:19,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 14:13:19,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2022-07-19 14:13:19,726 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 24 [2022-07-19 14:13:19,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:13:19,726 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2022-07-19 14:13:19,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 14:13:19,726 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2022-07-19 14:13:19,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-19 14:13:19,727 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:13:19,727 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:13:19,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-19 14:13:19,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:13:19,939 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:13:19,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:13:19,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1641177467, now seen corresponding path program 1 times [2022-07-19 14:13:19,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:13:19,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2055372998] [2022-07-19 14:13:19,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:13:19,940 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:13:19,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:13:19,941 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:13:19,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-19 14:13:20,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:13:20,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 14:13:20,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:13:20,029 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 14:13:20,030 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:13:20,030 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:13:20,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2055372998] [2022-07-19 14:13:20,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2055372998] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:13:20,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:13:20,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:13:20,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520519787] [2022-07-19 14:13:20,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:13:20,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:13:20,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:13:20,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:13:20,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:13:20,032 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 14:13:20,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:13:20,053 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2022-07-19 14:13:20,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:13:20,054 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2022-07-19 14:13:20,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:13:20,055 INFO L225 Difference]: With dead ends: 35 [2022-07-19 14:13:20,055 INFO L226 Difference]: Without dead ends: 31 [2022-07-19 14:13:20,055 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:13:20,056 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:13:20,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:13:20,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-19 14:13:20,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2022-07-19 14:13:20,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 14:13:20,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2022-07-19 14:13:20,061 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 25 [2022-07-19 14:13:20,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:13:20,061 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2022-07-19 14:13:20,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 14:13:20,061 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2022-07-19 14:13:20,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-19 14:13:20,062 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:13:20,062 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:13:20,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-19 14:13:20,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:13:20,274 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:13:20,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:13:20,275 INFO L85 PathProgramCache]: Analyzing trace with hash -984557701, now seen corresponding path program 1 times [2022-07-19 14:13:20,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:13:20,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1858183260] [2022-07-19 14:13:20,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:13:20,276 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:13:20,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:13:20,277 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:13:20,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-19 14:13:20,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:13:20,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-19 14:13:20,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:13:20,420 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-19 14:13:20,420 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:13:20,421 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:13:20,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1858183260] [2022-07-19 14:13:20,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1858183260] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:13:20,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:13:20,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:13:20,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992160483] [2022-07-19 14:13:20,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:13:20,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:13:20,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:13:20,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:13:20,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:13:20,422 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 14:13:20,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:13:20,425 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-07-19 14:13:20,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:13:20,425 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2022-07-19 14:13:20,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:13:20,425 INFO L225 Difference]: With dead ends: 37 [2022-07-19 14:13:20,426 INFO L226 Difference]: Without dead ends: 32 [2022-07-19 14:13:20,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:13:20,426 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 4 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:13:20,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 75 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 4 Unchecked, 0.0s Time] [2022-07-19 14:13:20,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-07-19 14:13:20,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2022-07-19 14:13:20,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 14:13:20,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-07-19 14:13:20,435 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 25 [2022-07-19 14:13:20,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:13:20,436 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-07-19 14:13:20,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 14:13:20,438 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-07-19 14:13:20,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-19 14:13:20,439 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:13:20,439 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:13:20,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-19 14:13:20,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:13:20,651 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:13:20,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:13:20,651 INFO L85 PathProgramCache]: Analyzing trace with hash -982710659, now seen corresponding path program 1 times [2022-07-19 14:13:20,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:13:20,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1683491190] [2022-07-19 14:13:20,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:13:20,652 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:13:20,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:13:20,653 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:13:20,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-19 14:13:20,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:13:20,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-19 14:13:20,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:13:20,900 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 14:13:20,900 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:13:20,900 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:13:20,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1683491190] [2022-07-19 14:13:20,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1683491190] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:13:20,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:13:20,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 14:13:20,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678415925] [2022-07-19 14:13:20,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:13:20,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 14:13:20,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:13:20,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 14:13:20,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-19 14:13:20,902 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 14:13:20,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:13:20,928 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2022-07-19 14:13:20,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 14:13:20,928 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2022-07-19 14:13:20,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:13:20,929 INFO L225 Difference]: With dead ends: 41 [2022-07-19 14:13:20,929 INFO L226 Difference]: Without dead ends: 34 [2022-07-19 14:13:20,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-19 14:13:20,929 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 7 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:13:20,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 122 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 24 Unchecked, 0.0s Time] [2022-07-19 14:13:20,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-19 14:13:20,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2022-07-19 14:13:20,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-19 14:13:20,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-07-19 14:13:20,934 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 25 [2022-07-19 14:13:20,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:13:20,934 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-07-19 14:13:20,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 14:13:20,934 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-07-19 14:13:20,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-19 14:13:20,935 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:13:20,935 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:13:20,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-19 14:13:21,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:13:21,136 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:13:21,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:13:21,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1961064157, now seen corresponding path program 1 times [2022-07-19 14:13:21,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:13:21,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1064315588] [2022-07-19 14:13:21,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:13:21,137 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:13:21,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:13:21,138 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:13:21,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-19 14:13:21,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:13:21,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-19 14:13:21,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:13:21,396 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 14:13:21,396 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:13:21,396 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:13:21,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1064315588] [2022-07-19 14:13:21,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1064315588] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:13:21,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:13:21,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 14:13:21,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363967980] [2022-07-19 14:13:21,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:13:21,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 14:13:21,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:13:21,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 14:13:21,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-19 14:13:21,398 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 14:13:21,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:13:21,422 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-07-19 14:13:21,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 14:13:21,422 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2022-07-19 14:13:21,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:13:21,422 INFO L225 Difference]: With dead ends: 43 [2022-07-19 14:13:21,423 INFO L226 Difference]: Without dead ends: 36 [2022-07-19 14:13:21,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-19 14:13:21,423 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 7 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 28 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:13:21,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 122 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 28 Unchecked, 0.0s Time] [2022-07-19 14:13:21,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-07-19 14:13:21,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2022-07-19 14:13:21,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-19 14:13:21,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-07-19 14:13:21,428 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 26 [2022-07-19 14:13:21,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:13:21,428 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-07-19 14:13:21,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 14:13:21,428 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-07-19 14:13:21,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-19 14:13:21,429 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:13:21,429 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:13:21,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-19 14:13:21,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:13:21,630 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:13:21,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:13:21,630 INFO L85 PathProgramCache]: Analyzing trace with hash -688209493, now seen corresponding path program 1 times [2022-07-19 14:13:21,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:13:21,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1089520625] [2022-07-19 14:13:21,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:13:21,631 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:13:21,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:13:21,632 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:13:21,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-19 14:13:21,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:13:21,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 14:13:21,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:13:21,718 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 14:13:21,718 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:13:21,718 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:13:21,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1089520625] [2022-07-19 14:13:21,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1089520625] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:13:21,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:13:21,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:13:21,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737872588] [2022-07-19 14:13:21,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:13:21,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:13:21,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:13:21,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:13:21,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:13:21,720 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 14:13:21,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:13:21,986 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-07-19 14:13:21,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:13:21,987 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2022-07-19 14:13:21,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:13:21,987 INFO L225 Difference]: With dead ends: 35 [2022-07-19 14:13:21,987 INFO L226 Difference]: Without dead ends: 31 [2022-07-19 14:13:21,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:13:21,988 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 14:13:21,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 14:13:21,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-19 14:13:21,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2022-07-19 14:13:21,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 14:13:21,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2022-07-19 14:13:21,992 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 26 [2022-07-19 14:13:21,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:13:21,992 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2022-07-19 14:13:21,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 14:13:21,992 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2022-07-19 14:13:21,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-19 14:13:21,993 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:13:21,993 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:13:22,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-19 14:13:22,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:13:22,194 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:13:22,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:13:22,194 INFO L85 PathProgramCache]: Analyzing trace with hash 199294188, now seen corresponding path program 1 times [2022-07-19 14:13:22,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:13:22,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1908555809] [2022-07-19 14:13:22,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:13:22,194 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:13:22,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:13:22,196 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:13:22,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-19 14:13:22,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:13:22,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-19 14:13:22,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:13:22,811 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 14:13:22,811 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:13:23,163 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:13:23,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1908555809] [2022-07-19 14:13:23,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1908555809] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:13:23,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1492557574] [2022-07-19 14:13:23,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:13:23,164 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-19 14:13:23,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-19 14:13:23,171 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-19 14:13:23,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2022-07-19 14:13:23,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:13:23,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-19 14:13:23,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:13:24,062 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-19 14:13:24,063 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:13:24,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1492557574] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:13:24,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 14:13:24,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2022-07-19 14:13:24,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78527127] [2022-07-19 14:13:24,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:13:24,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 14:13:24,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:13:24,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 14:13:24,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2022-07-19 14:13:24,065 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 14:13:24,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:13:24,382 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-07-19 14:13:24,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 14:13:24,383 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2022-07-19 14:13:24,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:13:24,383 INFO L225 Difference]: With dead ends: 32 [2022-07-19 14:13:24,383 INFO L226 Difference]: Without dead ends: 28 [2022-07-19 14:13:24,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2022-07-19 14:13:24,384 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 17 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:13:24,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 105 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 14:13:24,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-19 14:13:24,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2022-07-19 14:13:24,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 14:13:24,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-07-19 14:13:24,388 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 26 [2022-07-19 14:13:24,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:13:24,388 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-07-19 14:13:24,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 14:13:24,388 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-07-19 14:13:24,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-19 14:13:24,389 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:13:24,389 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:13:24,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Forceful destruction successful, exit code 0 [2022-07-19 14:13:24,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-19 14:13:24,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:13:24,789 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:13:24,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:13:24,790 INFO L85 PathProgramCache]: Analyzing trace with hash -865134783, now seen corresponding path program 1 times [2022-07-19 14:13:24,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:13:24,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [594989471] [2022-07-19 14:13:24,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:13:24,791 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:13:24,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:13:24,792 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:13:24,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-19 14:13:24,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:13:24,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-19 14:13:24,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:13:25,023 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 14:13:25,023 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:13:25,023 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:13:25,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [594989471] [2022-07-19 14:13:25,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [594989471] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:13:25,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:13:25,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 14:13:25,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883356471] [2022-07-19 14:13:25,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:13:25,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 14:13:25,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:13:25,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 14:13:25,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-19 14:13:25,025 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 14:13:25,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:13:25,045 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2022-07-19 14:13:25,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 14:13:25,045 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2022-07-19 14:13:25,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:13:25,046 INFO L225 Difference]: With dead ends: 36 [2022-07-19 14:13:25,046 INFO L226 Difference]: Without dead ends: 29 [2022-07-19 14:13:25,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-19 14:13:25,046 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 3 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 28 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:13:25,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 92 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 28 Unchecked, 0.0s Time] [2022-07-19 14:13:25,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-19 14:13:25,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2022-07-19 14:13:25,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 14:13:25,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-07-19 14:13:25,050 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 27 [2022-07-19 14:13:25,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:13:25,051 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-07-19 14:13:25,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 14:13:25,051 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-07-19 14:13:25,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-19 14:13:25,052 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:13:25,052 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:13:25,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-19 14:13:25,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:13:25,264 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:13:25,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:13:25,264 INFO L85 PathProgramCache]: Analyzing trace with hash 109054183, now seen corresponding path program 1 times [2022-07-19 14:13:25,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:13:25,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1910957478] [2022-07-19 14:13:25,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:13:25,265 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:13:25,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:13:25,266 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:13:25,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-19 14:13:25,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:13:25,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-19 14:13:25,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:13:25,557 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 14:13:25,558 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:13:25,558 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:13:25,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1910957478] [2022-07-19 14:13:25,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1910957478] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:13:25,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:13:25,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 14:13:25,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133628109] [2022-07-19 14:13:25,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:13:25,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 14:13:25,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:13:25,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 14:13:25,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-19 14:13:25,559 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 14:13:25,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:13:25,584 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-07-19 14:13:25,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 14:13:25,584 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2022-07-19 14:13:25,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:13:25,585 INFO L225 Difference]: With dead ends: 34 [2022-07-19 14:13:25,585 INFO L226 Difference]: Without dead ends: 27 [2022-07-19 14:13:25,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-19 14:13:25,586 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 3 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 28 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:13:25,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 82 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 28 Unchecked, 0.0s Time] [2022-07-19 14:13:25,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-19 14:13:25,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2022-07-19 14:13:25,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 14:13:25,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-07-19 14:13:25,589 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 28 [2022-07-19 14:13:25,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:13:25,589 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-07-19 14:13:25,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 14:13:25,589 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-07-19 14:13:25,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-19 14:13:25,590 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:13:25,590 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:13:25,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-07-19 14:13:25,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:13:25,801 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:13:25,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:13:25,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1698400280, now seen corresponding path program 1 times [2022-07-19 14:13:25,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:13:25,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1151899171] [2022-07-19 14:13:25,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:13:25,802 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:13:25,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:13:25,803 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:13:25,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-19 14:13:25,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:13:25,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 14:13:25,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:13:25,896 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 14:13:25,897 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:13:25,897 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:13:25,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1151899171] [2022-07-19 14:13:25,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1151899171] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:13:25,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:13:25,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:13:25,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113976555] [2022-07-19 14:13:25,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:13:25,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:13:25,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:13:25,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:13:25,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:13:25,901 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 14:13:25,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:13:25,917 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-07-19 14:13:25,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:13:25,918 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2022-07-19 14:13:25,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:13:25,918 INFO L225 Difference]: With dead ends: 25 [2022-07-19 14:13:25,918 INFO L226 Difference]: Without dead ends: 0 [2022-07-19 14:13:25,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:13:25,919 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:13:25,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:13:25,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-19 14:13:25,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-19 14:13:25,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:13:25,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-19 14:13:25,921 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2022-07-19 14:13:25,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:13:25,921 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-19 14:13:25,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 14:13:25,921 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-19 14:13:25,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-19 14:13:25,924 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-19 14:13:25,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-07-19 14:13:26,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:13:26,137 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-19 14:13:26,628 INFO L899 garLoopResultBuilder]: For program point L31-1(lines 31 36) no Hoare annotation was computed. [2022-07-19 14:13:26,629 INFO L895 garLoopResultBuilder]: At program point L31-2(lines 31 36) the Hoare annotation is: (= |__fpclassify_double_#in~x| __fpclassify_double_~x) [2022-07-19 14:13:26,629 INFO L899 garLoopResultBuilder]: For program point L31-3(lines 28 53) no Hoare annotation was computed. [2022-07-19 14:13:26,629 INFO L899 garLoopResultBuilder]: For program point __fpclassify_doubleFINAL(lines 28 53) no Hoare annotation was computed. [2022-07-19 14:13:26,629 INFO L899 garLoopResultBuilder]: For program point L48(lines 48 52) no Hoare annotation was computed. [2022-07-19 14:13:26,629 INFO L899 garLoopResultBuilder]: For program point L44(lines 44 52) no Hoare annotation was computed. [2022-07-19 14:13:26,629 INFO L902 garLoopResultBuilder]: At program point __fpclassify_doubleENTRY(lines 28 53) the Hoare annotation is: true [2022-07-19 14:13:26,629 INFO L899 garLoopResultBuilder]: For program point __fpclassify_doubleEXIT(lines 28 53) no Hoare annotation was computed. [2022-07-19 14:13:26,630 INFO L899 garLoopResultBuilder]: For program point L41(lines 41 52) no Hoare annotation was computed. [2022-07-19 14:13:26,630 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-19 14:13:26,630 INFO L899 garLoopResultBuilder]: For program point L62(line 62) no Hoare annotation was computed. [2022-07-19 14:13:26,630 INFO L899 garLoopResultBuilder]: For program point L62-2(line 62) no Hoare annotation was computed. [2022-07-19 14:13:26,630 INFO L895 garLoopResultBuilder]: At program point L62-3(lines 55 63) the Hoare annotation is: (and (= (_ bv0 32) |ULTIMATE.start_isnan_double_#res#1|) (= |ULTIMATE.start_fmax_double_~x#1| |ULTIMATE.start_main_~x~0#1|) (fp.eq |ULTIMATE.start_fmax_double_~x#1| |ULTIMATE.start_fmax_double_~x#1|) (= |ULTIMATE.start_fmax_double_#res#1| |ULTIMATE.start_main_~x~0#1|)) [2022-07-19 14:13:26,630 INFO L902 garLoopResultBuilder]: At program point L85(lines 65 86) the Hoare annotation is: true [2022-07-19 14:13:26,630 INFO L899 garLoopResultBuilder]: For program point L79(lines 79 82) no Hoare annotation was computed. [2022-07-19 14:13:26,630 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-19 14:13:26,630 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-19 14:13:26,630 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-19 14:13:26,630 INFO L895 garLoopResultBuilder]: At program point L59(line 59) the Hoare annotation is: (and (= (_ bv0 32) |ULTIMATE.start_isnan_double_#res#1|) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start_fmax_double_~y#1|)) (= |ULTIMATE.start_fmax_double_~x#1| |ULTIMATE.start_main_~x~0#1|) (fp.eq |ULTIMATE.start_fmax_double_~x#1| |ULTIMATE.start_fmax_double_~x#1|)) [2022-07-19 14:13:26,630 INFO L899 garLoopResultBuilder]: For program point L59-1(lines 59 60) no Hoare annotation was computed. [2022-07-19 14:13:26,630 INFO L895 garLoopResultBuilder]: At program point L57(line 57) the Hoare annotation is: (and (= (_ bv0 32) |ULTIMATE.start_isnan_double_#res#1|) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start_fmax_double_~y#1|)) (= |ULTIMATE.start_fmax_double_~x#1| |ULTIMATE.start_main_~x~0#1|) (fp.eq |ULTIMATE.start_fmax_double_~x#1| |ULTIMATE.start_fmax_double_~x#1|)) [2022-07-19 14:13:26,631 INFO L899 garLoopResultBuilder]: For program point L57-1(lines 57 58) no Hoare annotation was computed. [2022-07-19 14:13:26,631 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2022-07-19 14:13:26,631 INFO L895 garLoopResultBuilder]: At program point L18(line 18) the Hoare annotation is: (and (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start_main_~y~0#1|)) (let ((.cse0 (fp.eq |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~x~0#1|))) (or (and (= (_ bv0 32) |ULTIMATE.start_isnan_double_#res#1|) .cse0) (and (= (_ bv1 32) |ULTIMATE.start_isnan_double_#res#1|) (not .cse0))))) [2022-07-19 14:13:26,631 INFO L899 garLoopResultBuilder]: For program point L80(line 80) no Hoare annotation was computed. [2022-07-19 14:13:26,631 INFO L899 garLoopResultBuilder]: For program point L74(lines 74 83) no Hoare annotation was computed. [2022-07-19 14:13:26,631 INFO L899 garLoopResultBuilder]: For program point L74-2(lines 74 83) no Hoare annotation was computed. [2022-07-19 14:13:26,634 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:13:26,635 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 14:13:26,640 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-19 14:13:26,645 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-19 14:13:26,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 02:13:26 BoogieIcfgContainer [2022-07-19 14:13:26,647 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 14:13:26,648 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 14:13:26,648 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 14:13:26,648 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 14:13:26,649 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:13:14" (3/4) ... [2022-07-19 14:13:26,651 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-19 14:13:26,661 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __fpclassify_double [2022-07-19 14:13:26,664 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2022-07-19 14:13:26,664 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2022-07-19 14:13:26,665 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-19 14:13:26,665 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-19 14:13:26,683 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y) && ((0bv32 == \result && ~fp.eq~DOUBLE(x, x)) || (1bv32 == \result && !~fp.eq~DOUBLE(x, x))) [2022-07-19 14:13:26,684 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(x) == x [2022-07-19 14:13:26,684 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((0bv32 == \result && x == x) && ~fp.eq~DOUBLE(x, x)) && \result == x [2022-07-19 14:13:26,695 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-19 14:13:26,695 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 14:13:26,696 INFO L158 Benchmark]: Toolchain (without parser) took 13029.65ms. Allocated memory was 48.2MB in the beginning and 71.3MB in the end (delta: 23.1MB). Free memory was 23.1MB in the beginning and 50.5MB in the end (delta: -27.4MB). Peak memory consumption was 23.8MB. Max. memory is 16.1GB. [2022-07-19 14:13:26,696 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 48.2MB. Free memory was 29.8MB in the beginning and 29.7MB in the end (delta: 31.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 14:13:26,696 INFO L158 Benchmark]: CACSL2BoogieTranslator took 291.52ms. Allocated memory was 48.2MB in the beginning and 58.7MB in the end (delta: 10.5MB). Free memory was 22.9MB in the beginning and 40.5MB in the end (delta: -17.6MB). Peak memory consumption was 3.3MB. Max. memory is 16.1GB. [2022-07-19 14:13:26,697 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.50ms. Allocated memory is still 58.7MB. Free memory was 40.5MB in the beginning and 38.9MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 14:13:26,697 INFO L158 Benchmark]: Boogie Preprocessor took 39.79ms. Allocated memory is still 58.7MB. Free memory was 38.9MB in the beginning and 37.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 14:13:26,697 INFO L158 Benchmark]: RCFGBuilder took 368.99ms. Allocated memory is still 58.7MB. Free memory was 37.5MB in the beginning and 39.4MB in the end (delta: -1.9MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. [2022-07-19 14:13:26,698 INFO L158 Benchmark]: TraceAbstraction took 12234.41ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 38.9MB in the beginning and 23.7MB in the end (delta: 15.2MB). Peak memory consumption was 26.9MB. Max. memory is 16.1GB. [2022-07-19 14:13:26,698 INFO L158 Benchmark]: Witness Printer took 47.53ms. Allocated memory is still 71.3MB. Free memory was 23.3MB in the beginning and 50.5MB in the end (delta: -27.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 14:13:26,701 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 48.2MB. Free memory was 29.8MB in the beginning and 29.7MB in the end (delta: 31.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 291.52ms. Allocated memory was 48.2MB in the beginning and 58.7MB in the end (delta: 10.5MB). Free memory was 22.9MB in the beginning and 40.5MB in the end (delta: -17.6MB). Peak memory consumption was 3.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.50ms. Allocated memory is still 58.7MB. Free memory was 40.5MB in the beginning and 38.9MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.79ms. Allocated memory is still 58.7MB. Free memory was 38.9MB in the beginning and 37.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 368.99ms. Allocated memory is still 58.7MB. Free memory was 37.5MB in the beginning and 39.4MB in the end (delta: -1.9MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. * TraceAbstraction took 12234.41ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 38.9MB in the beginning and 23.7MB in the end (delta: 15.2MB). Peak memory consumption was 26.9MB. Max. memory is 16.1GB. * Witness Printer took 47.53ms. Allocated memory is still 71.3MB. Free memory was 23.3MB in the beginning and 50.5MB in the end (delta: -27.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] * 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 - PositiveResult [Line: 80]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.2s, OverallIterations: 17, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 66 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 62 mSDsluCounter, 1449 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 141 IncrementalHoareTripleChecker+Unchecked, 988 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 173 IncrementalHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 461 mSDtfsCounter, 173 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 416 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=11, InterpolantAutomatonStates: 91, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 37 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 13 PreInvPairs, 18 NumberOfFragments, 76 HoareAnnotationTreeSize, 13 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 254 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 407 NumberOfCodeBlocks, 407 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 389 ConstructedInterpolants, 65 QuantifiedInterpolants, 1566 SizeOfPredicates, 62 NumberOfNonLiveVariables, 1424 ConjunctsInSsa, 123 ConjunctsInUnsatCore, 18 InterpolantComputations, 17 PerfectInterpolantSequences, 67/72 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 18]: Loop Invariant [2022-07-19 14:13:26,723 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-19 14:13:26,723 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y) && ((0bv32 == \result && ~fp.eq~DOUBLE(x, x)) || (1bv32 == \result && !~fp.eq~DOUBLE(x, x))) - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: \old(x) == x - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: ((0bv32 == \result && x == x) && ~fp.eq~DOUBLE(x, x)) && \result == x RESULT: Ultimate proved your program to be correct! [2022-07-19 14:13:26,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE