./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_1252a.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 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_1252a.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 2743c9c1eae15f6a9812481781d831b3850f89be91644ec8a207d83f9a71b29e --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 01:48:50,323 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 01:48:50,325 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 01:48:50,373 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 01:48:50,373 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 01:48:50,375 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 01:48:50,379 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 01:48:50,382 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 01:48:50,392 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 01:48:50,398 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 01:48:50,400 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 01:48:50,402 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 01:48:50,402 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 01:48:50,404 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 01:48:50,405 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 01:48:50,406 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 01:48:50,407 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 01:48:50,407 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 01:48:50,409 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 01:48:50,412 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 01:48:50,417 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 01:48:50,420 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 01:48:50,422 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 01:48:50,423 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 01:48:50,425 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 01:48:50,431 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 01:48:50,432 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 01:48:50,433 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 01:48:50,434 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 01:48:50,434 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 01:48:50,435 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 01:48:50,435 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 01:48:50,437 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 01:48:50,438 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 01:48:50,439 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 01:48:50,440 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 01:48:50,440 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 01:48:50,441 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 01:48:50,441 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 01:48:50,441 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 01:48:50,442 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 01:48:50,443 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 01:48:50,448 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-21 01:48:50,478 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 01:48:50,479 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 01:48:50,480 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 01:48:50,480 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 01:48:50,481 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 01:48:50,481 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 01:48:50,482 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 01:48:50,482 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 01:48:50,482 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 01:48:50,483 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 01:48:50,483 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 01:48:50,483 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 01:48:50,484 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 01:48:50,484 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 01:48:50,484 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 01:48:50,484 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 01:48:50,484 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 01:48:50,485 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 01:48:50,485 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 01:48:50,485 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 01:48:50,485 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 01:48:50,485 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 01:48:50,486 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 01:48:50,486 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 01:48:50,486 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 01:48:50,486 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 01:48:50,486 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 01:48:50,487 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 01:48:50,487 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 01:48:50,487 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 01:48:50,487 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 01:48:50,488 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 01:48:50,488 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 01:48:50,488 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 -> 2743c9c1eae15f6a9812481781d831b3850f89be91644ec8a207d83f9a71b29e [2022-07-21 01:48:50,811 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 01:48:50,838 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 01:48:50,841 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 01:48:50,842 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 01:48:50,843 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 01:48:50,844 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1252a.c [2022-07-21 01:48:50,903 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8aa1f7153/27f91a31b09f4b9c85ee6e47fc3ee140/FLAGe4320ec82 [2022-07-21 01:48:51,418 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 01:48:51,419 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1252a.c [2022-07-21 01:48:51,426 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8aa1f7153/27f91a31b09f4b9c85ee6e47fc3ee140/FLAGe4320ec82 [2022-07-21 01:48:51,895 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8aa1f7153/27f91a31b09f4b9c85ee6e47fc3ee140 [2022-07-21 01:48:51,898 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 01:48:51,899 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 01:48:51,901 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 01:48:51,901 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 01:48:51,904 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 01:48:51,905 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 01:48:51" (1/1) ... [2022-07-21 01:48:51,906 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b692e62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:48:51, skipping insertion in model container [2022-07-21 01:48:51,906 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 01:48:51" (1/1) ... [2022-07-21 01:48:51,912 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 01:48:51,929 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 01:48:52,101 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_1252a.c[2154,2167] [2022-07-21 01:48:52,113 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 01:48:52,149 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 01:48:52,186 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_1252a.c[2154,2167] [2022-07-21 01:48:52,189 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 01:48:52,203 INFO L208 MainTranslator]: Completed translation [2022-07-21 01:48:52,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:48:52 WrapperNode [2022-07-21 01:48:52,204 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 01:48:52,205 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 01:48:52,205 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 01:48:52,205 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 01:48:52,211 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:48:52" (1/1) ... [2022-07-21 01:48:52,225 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:48:52" (1/1) ... [2022-07-21 01:48:52,245 INFO L137 Inliner]: procedures = 18, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 67 [2022-07-21 01:48:52,246 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 01:48:52,247 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 01:48:52,247 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 01:48:52,247 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 01:48:52,253 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:48:52" (1/1) ... [2022-07-21 01:48:52,254 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:48:52" (1/1) ... [2022-07-21 01:48:52,259 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:48:52" (1/1) ... [2022-07-21 01:48:52,260 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:48:52" (1/1) ... [2022-07-21 01:48:52,277 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:48:52" (1/1) ... [2022-07-21 01:48:52,283 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:48:52" (1/1) ... [2022-07-21 01:48:52,287 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:48:52" (1/1) ... [2022-07-21 01:48:52,289 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 01:48:52,291 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 01:48:52,292 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 01:48:52,292 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 01:48:52,293 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:48:52" (1/1) ... [2022-07-21 01:48:52,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 01:48:52,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 01:48:52,320 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-21 01:48:52,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 01:48:52,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 01:48:52,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 01:48:52,360 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2022-07-21 01:48:52,360 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2022-07-21 01:48:52,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-07-21 01:48:52,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 01:48:52,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 01:48:52,361 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 01:48:52,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 01:48:52,347 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-21 01:48:52,442 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 01:48:52,444 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 01:48:52,634 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 01:48:52,640 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 01:48:52,640 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-21 01:48:52,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:48:52 BoogieIcfgContainer [2022-07-21 01:48:52,642 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 01:48:52,643 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 01:48:52,644 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 01:48:52,646 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 01:48:52,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 01:48:51" (1/3) ... [2022-07-21 01:48:52,647 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3873598f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 01:48:52, skipping insertion in model container [2022-07-21 01:48:52,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:48:52" (2/3) ... [2022-07-21 01:48:52,648 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3873598f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 01:48:52, skipping insertion in model container [2022-07-21 01:48:52,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:48:52" (3/3) ... [2022-07-21 01:48:52,649 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_1252a.c [2022-07-21 01:48:52,662 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 01:48:52,663 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 01:48:52,743 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 01:48:52,760 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@4837e9af, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1dbd1031 [2022-07-21 01:48:52,762 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 01:48:52,767 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 27 states have internal predecessors, (40), 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-21 01:48:52,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-21 01:48:52,776 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:48:52,777 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:48:52,778 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:48:52,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:48:52,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1634587165, now seen corresponding path program 1 times [2022-07-21 01:48:52,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:48:52,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372913370] [2022-07-21 01:48:52,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:48:52,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:48:52,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:48:52,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 01:48:52,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:48:52,989 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-21 01:48:52,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:48:52,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372913370] [2022-07-21 01:48:52,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372913370] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:48:52,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:48:52,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 01:48:52,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640894803] [2022-07-21 01:48:52,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:48:52,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 01:48:52,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 01:48:53,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 01:48:53,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 01:48:53,034 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 27 states have internal predecessors, (40), 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.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-21 01:48:53,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:48:53,094 INFO L93 Difference]: Finished difference Result 59 states and 86 transitions. [2022-07-21 01:48:53,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 01:48:53,097 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.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-21 01:48:53,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:48:53,104 INFO L225 Difference]: With dead ends: 59 [2022-07-21 01:48:53,104 INFO L226 Difference]: Without dead ends: 28 [2022-07-21 01:48:53,107 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-21 01:48:53,113 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 01:48:53,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 71 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 01:48:53,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-21 01:48:53,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-07-21 01:48:53,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 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-21 01:48:53,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2022-07-21 01:48:53,159 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 14 [2022-07-21 01:48:53,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:48:53,160 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2022-07-21 01:48:53,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.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-21 01:48:53,161 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-07-21 01:48:53,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-21 01:48:53,164 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:48:53,164 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:48:53,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 01:48:53,165 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:48:53,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:48:53,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1992797582, now seen corresponding path program 1 times [2022-07-21 01:48:53,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:48:53,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927326292] [2022-07-21 01:48:53,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:48:53,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:48:53,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:48:53,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 01:48:53,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:48:53,344 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-21 01:48:53,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:48:53,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927326292] [2022-07-21 01:48:53,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927326292] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:48:53,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:48:53,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 01:48:53,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488022997] [2022-07-21 01:48:53,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:48:53,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 01:48:53,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 01:48:53,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 01:48:53,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 01:48:53,350 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 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-21 01:48:53,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:48:53,399 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2022-07-21 01:48:53,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 01:48:53,400 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 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-21 01:48:53,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:48:53,403 INFO L225 Difference]: With dead ends: 41 [2022-07-21 01:48:53,403 INFO L226 Difference]: Without dead ends: 32 [2022-07-21 01:48:53,407 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-21 01:48:53,409 INFO L413 NwaCegarLoop]: 33 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, 118 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-21 01:48:53,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 118 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 01:48:53,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-07-21 01:48:53,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-07-21 01:48:53,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 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-21 01:48:53,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-07-21 01:48:53,426 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 15 [2022-07-21 01:48:53,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:48:53,427 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-07-21 01:48:53,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 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-21 01:48:53,428 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-07-21 01:48:53,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-21 01:48:53,429 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:48:53,434 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:48:53,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 01:48:53,435 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:48:53,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:48:53,435 INFO L85 PathProgramCache]: Analyzing trace with hash -118167546, now seen corresponding path program 1 times [2022-07-21 01:48:53,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:48:53,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106197830] [2022-07-21 01:48:53,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:48:53,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:48:53,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:48:53,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 01:48:53,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:48:53,517 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-21 01:48:53,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:48:53,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106197830] [2022-07-21 01:48:53,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106197830] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:48:53,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:48:53,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 01:48:53,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412761497] [2022-07-21 01:48:53,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:48:53,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 01:48:53,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 01:48:53,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 01:48:53,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 01:48:53,520 INFO L87 Difference]: Start difference. First operand 32 states and 41 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-21 01:48:53,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:48:53,577 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-07-21 01:48:53,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 01:48:53,578 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-21 01:48:53,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:48:53,579 INFO L225 Difference]: With dead ends: 45 [2022-07-21 01:48:53,579 INFO L226 Difference]: Without dead ends: 36 [2022-07-21 01:48:53,580 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-21 01:48:53,581 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 01:48:53,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 134 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 01:48:53,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-07-21 01:48:53,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2022-07-21 01:48:53,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 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-21 01:48:53,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-07-21 01:48:53,590 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 16 [2022-07-21 01:48:53,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:48:53,591 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-07-21 01:48:53,591 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-21 01:48:53,591 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-07-21 01:48:53,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-21 01:48:53,593 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:48:53,594 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:48:53,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 01:48:53,594 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:48:53,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:48:53,595 INFO L85 PathProgramCache]: Analyzing trace with hash -774061834, now seen corresponding path program 1 times [2022-07-21 01:48:53,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:48:53,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889035634] [2022-07-21 01:48:53,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:48:53,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:48:53,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:48:53,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 01:48:53,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:48:53,694 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-21 01:48:53,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:48:53,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889035634] [2022-07-21 01:48:53,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889035634] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:48:53,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:48:53,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 01:48:53,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98882389] [2022-07-21 01:48:53,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:48:53,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 01:48:53,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 01:48:53,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 01:48:53,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 01:48:53,697 INFO L87 Difference]: Start difference. First operand 32 states and 41 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-21 01:48:53,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:48:53,729 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-07-21 01:48:53,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 01:48:53,729 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-21 01:48:53,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:48:53,730 INFO L225 Difference]: With dead ends: 45 [2022-07-21 01:48:53,730 INFO L226 Difference]: Without dead ends: 36 [2022-07-21 01:48:53,731 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-21 01:48:53,732 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 01:48:53,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 134 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 01:48:53,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-07-21 01:48:53,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2022-07-21 01:48:53,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 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-21 01:48:53,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-07-21 01:48:53,738 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 17 [2022-07-21 01:48:53,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:48:53,739 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-07-21 01:48:53,739 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-21 01:48:53,739 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-07-21 01:48:53,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-21 01:48:53,740 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:48:53,740 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-21 01:48:53,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 01:48:53,740 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:48:53,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:48:53,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1728168458, now seen corresponding path program 1 times [2022-07-21 01:48:53,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:48:53,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866401492] [2022-07-21 01:48:53,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:48:53,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:48:53,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:48:53,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 01:48:53,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:48:53,857 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-21 01:48:53,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:48:53,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866401492] [2022-07-21 01:48:53,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866401492] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:48:53,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:48:53,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 01:48:53,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609116425] [2022-07-21 01:48:53,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:48:53,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 01:48:53,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 01:48:53,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 01:48:53,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 01:48:53,865 INFO L87 Difference]: Start difference. First operand 32 states and 41 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-21 01:48:53,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:48:53,910 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-07-21 01:48:53,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 01:48:53,911 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-21 01:48:53,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:48:53,912 INFO L225 Difference]: With dead ends: 45 [2022-07-21 01:48:53,912 INFO L226 Difference]: Without dead ends: 36 [2022-07-21 01:48:53,912 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-21 01:48:53,913 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 01:48:53,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 134 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 01:48:53,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-07-21 01:48:53,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2022-07-21 01:48:53,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 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-21 01:48:53,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-07-21 01:48:53,919 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 18 [2022-07-21 01:48:53,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:48:53,919 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-07-21 01:48:53,920 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-21 01:48:53,920 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-07-21 01:48:53,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-21 01:48:53,920 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:48:53,921 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-21 01:48:53,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 01:48:53,921 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:48:53,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:48:53,921 INFO L85 PathProgramCache]: Analyzing trace with hash -79286005, now seen corresponding path program 1 times [2022-07-21 01:48:53,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:48:53,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65645477] [2022-07-21 01:48:53,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:48:53,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:48:53,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 01:48:53,938 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-21 01:48:53,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 01:48:53,963 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-21 01:48:53,964 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-21 01:48:53,965 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-21 01:48:53,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 01:48:53,969 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-07-21 01:48:53,973 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-21 01:48:53,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 01:48:53 BoogieIcfgContainer [2022-07-21 01:48:53,999 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-21 01:48:53,999 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-21 01:48:54,000 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-21 01:48:54,000 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-21 01:48:54,000 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:48:52" (3/4) ... [2022-07-21 01:48:54,003 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-21 01:48:54,003 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-21 01:48:54,004 INFO L158 Benchmark]: Toolchain (without parser) took 2104.99ms. Allocated memory was 48.2MB in the beginning and 71.3MB in the end (delta: 23.1MB). Free memory was 24.4MB in the beginning and 39.9MB in the end (delta: -15.5MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. [2022-07-21 01:48:54,005 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 48.2MB. Free memory was 31.0MB in the beginning and 31.0MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 01:48:54,006 INFO L158 Benchmark]: CACSL2BoogieTranslator took 303.65ms. Allocated memory was 48.2MB in the beginning and 58.7MB in the end (delta: 10.5MB). Free memory was 24.1MB in the beginning and 41.7MB in the end (delta: -17.5MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. [2022-07-21 01:48:54,007 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.71ms. Allocated memory is still 58.7MB. Free memory was 41.5MB in the beginning and 40.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 01:48:54,007 INFO L158 Benchmark]: Boogie Preprocessor took 43.62ms. Allocated memory is still 58.7MB. Free memory was 40.0MB in the beginning and 38.8MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 01:48:54,007 INFO L158 Benchmark]: RCFGBuilder took 350.81ms. Allocated memory is still 58.7MB. Free memory was 38.6MB in the beginning and 39.9MB in the end (delta: -1.3MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. [2022-07-21 01:48:54,008 INFO L158 Benchmark]: TraceAbstraction took 1355.39ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 39.4MB in the beginning and 40.3MB in the end (delta: -910.4kB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. [2022-07-21 01:48:54,008 INFO L158 Benchmark]: Witness Printer took 3.74ms. Allocated memory is still 71.3MB. Free memory was 40.3MB in the beginning and 39.9MB in the end (delta: 456.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 01:48:54,010 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.24ms. Allocated memory is still 48.2MB. Free memory was 31.0MB in the beginning and 31.0MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 303.65ms. Allocated memory was 48.2MB in the beginning and 58.7MB in the end (delta: 10.5MB). Free memory was 24.1MB in the beginning and 41.7MB in the end (delta: -17.5MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.71ms. Allocated memory is still 58.7MB. Free memory was 41.5MB in the beginning and 40.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.62ms. Allocated memory is still 58.7MB. Free memory was 40.0MB in the beginning and 38.8MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 350.81ms. Allocated memory is still 58.7MB. Free memory was 38.6MB in the beginning and 39.9MB in the end (delta: -1.3MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. * TraceAbstraction took 1355.39ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 39.4MB in the beginning and 40.3MB in the end (delta: -910.4kB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. * Witness Printer took 3.74ms. Allocated memory is still 71.3MB. Free memory was 40.3MB in the beginning and 39.9MB in the end (delta: 456.0kB). 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: 87]: 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 86, overapproximation of someUnaryDOUBLEoperation at line 81. Possible FailurePath: [L81] double x = -0.0; [L82] double y = 0.0; [L83] CALL, EXPR fmax_double(x, y) [L54] CALL, EXPR __fpclassify_double(x) VAL [\old(x)=4294967298] [L26] __uint32_t msw, lsw; VAL [\old(x)=4294967298, x=4294967298] [L29] ieee_double_shape_type ew_u; [L30] ew_u.value = (x) [L31] EXPR ew_u.parts.msw [L31] (msw) = ew_u.parts.msw [L32] EXPR ew_u.parts.lsw [L32] (lsw) = ew_u.parts.lsw [L35-L36] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) VAL [\old(x)=4294967298, lsw=4294967297, msw=4293918721, x=4294967298] [L38-L39] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) VAL [\old(x)=4294967298, lsw=4294967297, msw=4293918721, x=4294967298] [L41-L42] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) VAL [\old(x)=4294967298, lsw=4294967297, msw=4293918721, x=4294967298] [L45-L46] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L49] return 0; VAL [\old(x)=4294967298, \result=0, lsw=4294967297, msw=4293918721, x=4294967298] [L54] RET, EXPR __fpclassify_double(x) VAL [\old(x)=4294967298, \old(y)=0, __fpclassify_double(x)=0, x=4294967298, y=0] [L54] COND TRUE __fpclassify_double(x) == 0 [L55] return y; VAL [\old(x)=4294967298, \old(y)=0, \result=0, x=4294967298, y=0] [L83] RET, EXPR fmax_double(x, y) [L83] double res = fmax_double(x, y); [L86] EXPR res == 0.0 && __signbit_double(res) == 0 VAL [res=0, res == 0.0 && __signbit_double(res) == 0=0, x=4294967298, y=0] [L86] COND TRUE !(res == 0.0 && __signbit_double(res) == 0) [L87] reach_error() VAL [res=0, x=4294967298, y=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, 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.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5 mSDsluCounter, 591 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 406 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 95 IncrementalHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 185 mSDtfsCounter, 95 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=32occurred in iteration=2, 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, 98 NumberOfCodeBlocks, 98 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 75 ConstructedInterpolants, 0 QuantifiedInterpolants, 207 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-21 01:48:54,056 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 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_1252a.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 2743c9c1eae15f6a9812481781d831b3850f89be91644ec8a207d83f9a71b29e --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 01:48:55,932 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 01:48:55,935 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 01:48:55,976 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 01:48:55,977 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 01:48:55,978 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 01:48:55,982 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 01:48:55,985 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 01:48:55,987 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 01:48:56,001 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 01:48:56,002 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 01:48:56,005 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 01:48:56,005 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 01:48:56,007 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 01:48:56,008 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 01:48:56,014 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 01:48:56,015 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 01:48:56,016 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 01:48:56,018 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 01:48:56,023 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 01:48:56,024 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 01:48:56,026 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 01:48:56,028 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 01:48:56,028 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 01:48:56,030 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 01:48:56,036 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 01:48:56,037 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 01:48:56,037 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 01:48:56,038 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 01:48:56,039 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 01:48:56,040 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 01:48:56,040 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 01:48:56,042 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 01:48:56,042 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 01:48:56,044 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 01:48:56,045 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 01:48:56,045 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 01:48:56,046 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 01:48:56,046 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 01:48:56,046 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 01:48:56,047 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 01:48:56,048 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 01:48:56,054 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-21 01:48:56,086 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 01:48:56,087 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 01:48:56,087 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 01:48:56,088 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 01:48:56,088 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 01:48:56,089 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 01:48:56,090 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 01:48:56,090 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 01:48:56,090 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 01:48:56,091 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 01:48:56,091 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 01:48:56,092 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 01:48:56,092 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 01:48:56,092 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 01:48:56,092 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 01:48:56,093 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 01:48:56,093 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-21 01:48:56,093 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-21 01:48:56,093 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-21 01:48:56,094 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 01:48:56,094 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 01:48:56,094 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 01:48:56,094 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 01:48:56,095 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 01:48:56,095 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 01:48:56,095 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 01:48:56,095 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 01:48:56,096 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 01:48:56,096 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 01:48:56,096 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 01:48:56,096 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-21 01:48:56,097 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-21 01:48:56,097 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 01:48:56,097 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 01:48:56,098 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 01:48:56,098 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-21 01:48:56,098 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 -> 2743c9c1eae15f6a9812481781d831b3850f89be91644ec8a207d83f9a71b29e [2022-07-21 01:48:56,422 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 01:48:56,439 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 01:48:56,441 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 01:48:56,442 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 01:48:56,447 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 01:48:56,448 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1252a.c [2022-07-21 01:48:56,510 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9dd4b7903/56520dd072c34d2c8cdada95485faa26/FLAG2de5c225e [2022-07-21 01:48:56,913 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 01:48:56,914 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1252a.c [2022-07-21 01:48:56,922 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9dd4b7903/56520dd072c34d2c8cdada95485faa26/FLAG2de5c225e [2022-07-21 01:48:57,316 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9dd4b7903/56520dd072c34d2c8cdada95485faa26 [2022-07-21 01:48:57,318 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 01:48:57,320 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 01:48:57,323 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 01:48:57,323 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 01:48:57,326 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 01:48:57,327 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 01:48:57" (1/1) ... [2022-07-21 01:48:57,328 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6592c9dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:48:57, skipping insertion in model container [2022-07-21 01:48:57,329 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 01:48:57" (1/1) ... [2022-07-21 01:48:57,338 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 01:48:57,353 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 01:48:57,495 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_1252a.c[2154,2167] [2022-07-21 01:48:57,497 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 01:48:57,521 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 01:48:57,566 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_1252a.c[2154,2167] [2022-07-21 01:48:57,567 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 01:48:57,600 INFO L208 MainTranslator]: Completed translation [2022-07-21 01:48:57,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:48:57 WrapperNode [2022-07-21 01:48:57,601 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 01:48:57,602 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 01:48:57,603 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 01:48:57,603 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 01:48:57,609 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:48:57" (1/1) ... [2022-07-21 01:48:57,627 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:48:57" (1/1) ... [2022-07-21 01:48:57,649 INFO L137 Inliner]: procedures = 21, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 65 [2022-07-21 01:48:57,650 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 01:48:57,651 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 01:48:57,651 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 01:48:57,652 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 01:48:57,660 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:48:57" (1/1) ... [2022-07-21 01:48:57,660 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:48:57" (1/1) ... [2022-07-21 01:48:57,670 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:48:57" (1/1) ... [2022-07-21 01:48:57,671 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:48:57" (1/1) ... [2022-07-21 01:48:57,690 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:48:57" (1/1) ... [2022-07-21 01:48:57,697 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:48:57" (1/1) ... [2022-07-21 01:48:57,703 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:48:57" (1/1) ... [2022-07-21 01:48:57,706 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 01:48:57,709 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 01:48:57,710 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 01:48:57,711 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 01:48:57,712 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:48:57" (1/1) ... [2022-07-21 01:48:57,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 01:48:57,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 01:48:57,745 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-21 01:48:57,772 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-21 01:48:57,788 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 01:48:57,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2022-07-21 01:48:57,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-21 01:48:57,788 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 01:48:57,789 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2022-07-21 01:48:57,789 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2022-07-21 01:48:57,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-21 01:48:57,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 01:48:57,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 01:48:57,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 01:48:57,875 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 01:48:57,876 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 01:48:58,022 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 01:48:58,027 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 01:48:58,027 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-21 01:48:58,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:48:58 BoogieIcfgContainer [2022-07-21 01:48:58,029 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 01:48:58,030 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 01:48:58,030 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 01:48:58,033 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 01:48:58,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 01:48:57" (1/3) ... [2022-07-21 01:48:58,034 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@537be42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 01:48:58, skipping insertion in model container [2022-07-21 01:48:58,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:48:57" (2/3) ... [2022-07-21 01:48:58,034 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@537be42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 01:48:58, skipping insertion in model container [2022-07-21 01:48:58,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:48:58" (3/3) ... [2022-07-21 01:48:58,035 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_1252a.c [2022-07-21 01:48:58,053 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 01:48:58,054 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 01:48:58,093 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 01:48:58,099 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@383aec5c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@78cff196 [2022-07-21 01:48:58,099 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 01:48:58,103 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 25 states have internal predecessors, (38), 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-21 01:48:58,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-21 01:48:58,110 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:48:58,110 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:48:58,111 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:48:58,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:48:58,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1130952206, now seen corresponding path program 1 times [2022-07-21 01:48:58,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:48:58,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1002306245] [2022-07-21 01:48:58,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:48:58,126 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:48:58,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:48:58,129 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-21 01:48:58,130 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-21 01:48:58,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:48:58,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-21 01:48:58,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:48:58,211 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-21 01:48:58,212 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:48:58,212 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:48:58,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1002306245] [2022-07-21 01:48:58,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1002306245] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:48:58,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:48:58,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 01:48:58,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644336986] [2022-07-21 01:48:58,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:48:58,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-21 01:48:58,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:48:58,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-21 01:48:58,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-21 01:48:58,242 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 25 states have internal predecessors, (38), 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 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-21 01:48:58,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:48:58,261 INFO L93 Difference]: Finished difference Result 55 states and 82 transitions. [2022-07-21 01:48:58,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-21 01:48:58,263 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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 13 [2022-07-21 01:48:58,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:48:58,269 INFO L225 Difference]: With dead ends: 55 [2022-07-21 01:48:58,269 INFO L226 Difference]: Without dead ends: 26 [2022-07-21 01:48:58,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 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-21 01:48:58,278 INFO L413 NwaCegarLoop]: 37 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, 37 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-21 01:48:58,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 01:48:58,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-07-21 01:48:58,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-07-21 01:48:58,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 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-21 01:48:58,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2022-07-21 01:48:58,324 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 13 [2022-07-21 01:48:58,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:48:58,324 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2022-07-21 01:48:58,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-21 01:48:58,324 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2022-07-21 01:48:58,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-21 01:48:58,326 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:48:58,326 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:48:58,334 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-21 01:48:58,532 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-21 01:48:58,533 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:48:58,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:48:58,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1285201507, now seen corresponding path program 1 times [2022-07-21 01:48:58,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:48:58,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [337473539] [2022-07-21 01:48:58,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:48:58,535 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:48:58,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:48:58,536 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-21 01:48:58,538 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-21 01:48:58,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:48:58,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 01:48:58,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:48:58,652 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-21 01:48:58,652 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:48:58,653 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:48:58,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [337473539] [2022-07-21 01:48:58,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [337473539] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:48:58,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:48:58,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 01:48:58,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562598761] [2022-07-21 01:48:58,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:48:58,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 01:48:58,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:48:58,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 01:48:58,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 01:48:58,656 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 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-21 01:48:58,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:48:58,680 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-07-21 01:48:58,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 01:48:58,681 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 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-21 01:48:58,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:48:58,683 INFO L225 Difference]: With dead ends: 38 [2022-07-21 01:48:58,683 INFO L226 Difference]: Without dead ends: 29 [2022-07-21 01:48:58,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 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-21 01:48:58,685 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 90 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.0s IncrementalHoareTripleChecker+Time [2022-07-21 01:48:58,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 01:48:58,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-21 01:48:58,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-07-21 01:48:58,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 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-21 01:48:58,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2022-07-21 01:48:58,692 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 14 [2022-07-21 01:48:58,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:48:58,693 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2022-07-21 01:48:58,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 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-21 01:48:58,693 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2022-07-21 01:48:58,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-21 01:48:58,694 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:48:58,694 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:48:58,714 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-21 01:48:58,905 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-21 01:48:58,906 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:48:58,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:48:58,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1497908235, now seen corresponding path program 1 times [2022-07-21 01:48:58,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:48:58,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1588362306] [2022-07-21 01:48:58,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:48:58,908 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:48:58,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:48:58,909 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-21 01:48:58,924 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-21 01:48:58,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:48:58,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-21 01:48:58,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:48:59,281 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-21 01:48:59,283 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:48:59,283 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:48:59,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1588362306] [2022-07-21 01:48:59,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1588362306] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:48:59,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:48:59,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 01:48:59,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134049451] [2022-07-21 01:48:59,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:48:59,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 01:48:59,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:48:59,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 01:48:59,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 01:48:59,293 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 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-21 01:48:59,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:48:59,362 INFO L93 Difference]: Finished difference Result 56 states and 73 transitions. [2022-07-21 01:48:59,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 01:48:59,363 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 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-21 01:48:59,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:48:59,364 INFO L225 Difference]: With dead ends: 56 [2022-07-21 01:48:59,364 INFO L226 Difference]: Without dead ends: 31 [2022-07-21 01:48:59,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-21 01:48:59,366 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 18 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 01:48:59,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 102 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 25 Unchecked, 0.0s Time] [2022-07-21 01:48:59,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-21 01:48:59,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-07-21 01:48:59,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.32) internal successors, (33), 26 states have internal predecessors, (33), 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-21 01:48:59,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 40 transitions. [2022-07-21 01:48:59,373 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 40 transitions. Word has length 15 [2022-07-21 01:48:59,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:48:59,374 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 40 transitions. [2022-07-21 01:48:59,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 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-21 01:48:59,374 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 40 transitions. [2022-07-21 01:48:59,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-21 01:48:59,375 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:48:59,375 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:48:59,385 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-21 01:48:59,584 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-21 01:48:59,584 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:48:59,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:48:59,585 INFO L85 PathProgramCache]: Analyzing trace with hash -2116811041, now seen corresponding path program 1 times [2022-07-21 01:48:59,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:48:59,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [679802598] [2022-07-21 01:48:59,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:48:59,586 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:48:59,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:48:59,588 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-21 01:48:59,590 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-21 01:48:59,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:48:59,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 01:48:59,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:48:59,658 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-21 01:48:59,659 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:48:59,659 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:48:59,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [679802598] [2022-07-21 01:48:59,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [679802598] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:48:59,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:48:59,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 01:48:59,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188805702] [2022-07-21 01:48:59,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:48:59,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 01:48:59,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:48:59,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 01:48:59,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 01:48:59,661 INFO L87 Difference]: Start difference. First operand 31 states and 40 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-21 01:49:00,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:49:00,075 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2022-07-21 01:49:00,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 01:49:00,077 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-21 01:49:00,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:49:00,078 INFO L225 Difference]: With dead ends: 43 [2022-07-21 01:49:00,078 INFO L226 Difference]: Without dead ends: 34 [2022-07-21 01:49:00,078 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-21 01:49:00,079 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 99 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-21 01:49:00,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 01:49:00,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-21 01:49:00,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2022-07-21 01:49:00,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.32) internal successors, (33), 26 states have internal predecessors, (33), 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-21 01:49:00,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 40 transitions. [2022-07-21 01:49:00,086 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 40 transitions. Word has length 16 [2022-07-21 01:49:00,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:49:00,086 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 40 transitions. [2022-07-21 01:49:00,086 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-21 01:49:00,086 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 40 transitions. [2022-07-21 01:49:00,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-21 01:49:00,087 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:49:00,087 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:49:00,103 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-21 01:49:00,304 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-21 01:49:00,304 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:49:00,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:49:00,305 INFO L85 PathProgramCache]: Analyzing trace with hash 172315143, now seen corresponding path program 1 times [2022-07-21 01:49:00,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:49:00,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1127506001] [2022-07-21 01:49:00,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:49:00,305 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:49:00,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:49:00,307 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-21 01:49:00,308 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-21 01:49:00,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:49:00,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-21 01:49:00,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:49:00,542 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-21 01:49:00,543 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:49:00,543 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:49:00,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1127506001] [2022-07-21 01:49:00,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1127506001] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:49:00,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:49:00,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 01:49:00,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235126276] [2022-07-21 01:49:00,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:49:00,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 01:49:00,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:49:00,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 01:49:00,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 01:49:00,546 INFO L87 Difference]: Start difference. First operand 31 states and 40 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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-21 01:49:00,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:49:00,665 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2022-07-21 01:49:00,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 01:49:00,669 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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-21 01:49:00,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:49:00,669 INFO L225 Difference]: With dead ends: 57 [2022-07-21 01:49:00,669 INFO L226 Difference]: Without dead ends: 30 [2022-07-21 01:49:00,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-21 01:49:00,671 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 18 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 01:49:00,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 88 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 25 Unchecked, 0.1s Time] [2022-07-21 01:49:00,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-21 01:49:00,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2022-07-21 01:49:00,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 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-21 01:49:00,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2022-07-21 01:49:00,675 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 17 [2022-07-21 01:49:00,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:49:00,676 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2022-07-21 01:49:00,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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-21 01:49:00,676 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2022-07-21 01:49:00,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-21 01:49:00,677 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:49:00,677 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:49:00,696 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-21 01:49:00,887 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-21 01:49:00,888 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:49:00,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:49:00,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1943218574, now seen corresponding path program 1 times [2022-07-21 01:49:00,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:49:00,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2024626375] [2022-07-21 01:49:00,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:49:00,889 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:49:00,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:49:00,891 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-21 01:49:00,892 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-21 01:49:00,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:49:00,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 01:49:00,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:49:00,976 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-21 01:49:00,977 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:49:00,977 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:49:00,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2024626375] [2022-07-21 01:49:00,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2024626375] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:49:00,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:49:00,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 01:49:00,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508635925] [2022-07-21 01:49:00,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:49:00,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 01:49:00,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:49:00,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 01:49:00,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 01:49:00,981 INFO L87 Difference]: Start difference. First operand 28 states and 35 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, (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-21 01:49:01,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:49:01,019 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2022-07-21 01:49:01,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 01:49:01,020 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, (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 22 [2022-07-21 01:49:01,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:49:01,021 INFO L225 Difference]: With dead ends: 40 [2022-07-21 01:49:01,021 INFO L226 Difference]: Without dead ends: 31 [2022-07-21 01:49:01,022 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 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-21 01:49:01,023 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 87 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.0s IncrementalHoareTripleChecker+Time [2022-07-21 01:49:01,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 01:49:01,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-21 01:49:01,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-07-21 01:49:01,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 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-21 01:49:01,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2022-07-21 01:49:01,028 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 22 [2022-07-21 01:49:01,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:49:01,029 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2022-07-21 01:49:01,029 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, (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-21 01:49:01,029 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2022-07-21 01:49:01,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-21 01:49:01,030 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:49:01,030 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:49:01,043 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-21 01:49:01,240 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-21 01:49:01,240 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:49:01,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:49:01,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1682849308, now seen corresponding path program 1 times [2022-07-21 01:49:01,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:49:01,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1370507511] [2022-07-21 01:49:01,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:49:01,241 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:49:01,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:49:01,243 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-21 01:49:01,244 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-21 01:49:01,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:49:01,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-21 01:49:01,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:49:01,485 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-21 01:49:01,485 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:49:01,485 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:49:01,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1370507511] [2022-07-21 01:49:01,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1370507511] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:49:01,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:49:01,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 01:49:01,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173683633] [2022-07-21 01:49:01,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:49:01,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 01:49:01,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:49:01,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 01:49:01,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 01:49:01,486 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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-21 01:49:01,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:49:01,529 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2022-07-21 01:49:01,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 01:49:01,534 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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 23 [2022-07-21 01:49:01,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:49:01,535 INFO L225 Difference]: With dead ends: 45 [2022-07-21 01:49:01,535 INFO L226 Difference]: Without dead ends: 31 [2022-07-21 01:49:01,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-21 01:49:01,536 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 16 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 01:49:01,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 102 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 19 Unchecked, 0.0s Time] [2022-07-21 01:49:01,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-21 01:49:01,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-07-21 01:49:01,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.24) internal successors, (31), 26 states have internal predecessors, (31), 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-21 01:49:01,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2022-07-21 01:49:01,541 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 23 [2022-07-21 01:49:01,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:49:01,541 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2022-07-21 01:49:01,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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-21 01:49:01,541 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2022-07-21 01:49:01,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-21 01:49:01,542 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:49:01,542 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-21 01:49:01,555 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-21 01:49:01,742 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-21 01:49:01,743 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:49:01,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:49:01,743 INFO L85 PathProgramCache]: Analyzing trace with hash 474937390, now seen corresponding path program 1 times [2022-07-21 01:49:01,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:49:01,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1494076867] [2022-07-21 01:49:01,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:49:01,744 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:49:01,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:49:01,745 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-21 01:49:01,746 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-21 01:49:01,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:49:01,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 01:49:01,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:49:01,825 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-21 01:49:01,825 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:49:01,826 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:49:01,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1494076867] [2022-07-21 01:49:01,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1494076867] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:49:01,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:49:01,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 01:49:01,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400247817] [2022-07-21 01:49:01,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:49:01,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 01:49:01,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:49:01,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 01:49:01,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 01:49:01,828 INFO L87 Difference]: Start difference. First operand 31 states and 38 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-21 01:49:02,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:49:02,134 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2022-07-21 01:49:02,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 01:49:02,135 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-21 01:49:02,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:49:02,135 INFO L225 Difference]: With dead ends: 41 [2022-07-21 01:49:02,135 INFO L226 Difference]: Without dead ends: 32 [2022-07-21 01:49:02,136 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-21 01:49:02,136 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 94 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-21 01:49:02,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 01:49:02,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-07-21 01:49:02,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2022-07-21 01:49:02,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-21 01:49:02,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2022-07-21 01:49:02,141 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 24 [2022-07-21 01:49:02,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:49:02,141 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-07-21 01:49:02,141 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-21 01:49:02,141 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-07-21 01:49:02,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-21 01:49:02,142 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:49:02,142 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:49:02,152 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-21 01:49:02,352 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-21 01:49:02,352 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:49:02,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:49:02,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1777787178, now seen corresponding path program 1 times [2022-07-21 01:49:02,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:49:02,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2120117251] [2022-07-21 01:49:02,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:49:02,354 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:49:02,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:49:02,355 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-21 01:49:02,356 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-21 01:49:02,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:49:02,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-21 01:49:02,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:49:02,472 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-21 01:49:02,472 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:49:02,472 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:49:02,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2120117251] [2022-07-21 01:49:02,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2120117251] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:49:02,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:49:02,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 01:49:02,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172876537] [2022-07-21 01:49:02,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:49:02,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 01:49:02,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:49:02,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 01:49:02,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 01:49:02,474 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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-21 01:49:02,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:49:02,547 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-07-21 01:49:02,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 01:49:02,548 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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 24 [2022-07-21 01:49:02,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:49:02,549 INFO L225 Difference]: With dead ends: 42 [2022-07-21 01:49:02,549 INFO L226 Difference]: Without dead ends: 39 [2022-07-21 01:49:02,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-07-21 01:49:02,550 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 34 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 01:49:02,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 114 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 01:49:02,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-07-21 01:49:02,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2022-07-21 01:49:02,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-21 01:49:02,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-07-21 01:49:02,554 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 24 [2022-07-21 01:49:02,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:49:02,554 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-07-21 01:49:02,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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-21 01:49:02,555 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-07-21 01:49:02,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-21 01:49:02,555 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:49:02,555 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:49:02,566 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-21 01:49:02,766 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-21 01:49:02,766 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:49:02,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:49:02,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1835045480, now seen corresponding path program 1 times [2022-07-21 01:49:02,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:49:02,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [351925030] [2022-07-21 01:49:02,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:49:02,767 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:49:02,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:49:02,769 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-21 01:49:02,770 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-21 01:49:02,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:49:02,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-21 01:49:02,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:49:02,890 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-21 01:49:02,890 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:49:02,890 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:49:02,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [351925030] [2022-07-21 01:49:02,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [351925030] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:49:02,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:49:02,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 01:49:02,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101009566] [2022-07-21 01:49:02,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:49:02,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 01:49:02,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:49:02,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 01:49:02,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 01:49:02,892 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-21 01:49:02,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:49:02,903 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2022-07-21 01:49:02,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 01:49:02,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 24 [2022-07-21 01:49:02,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:49:02,905 INFO L225 Difference]: With dead ends: 41 [2022-07-21 01:49:02,908 INFO L226 Difference]: Without dead ends: 31 [2022-07-21 01:49:02,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 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-21 01:49:02,909 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 12 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 01:49:02,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 41 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 01:49:02,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-21 01:49:02,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-07-21 01:49:02,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-21 01:49:02,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2022-07-21 01:49:02,920 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 24 [2022-07-21 01:49:02,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:49:02,921 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2022-07-21 01:49:02,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-21 01:49:02,921 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-07-21 01:49:02,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-21 01:49:02,925 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:49:02,925 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-21 01:49:02,937 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-21 01:49:03,135 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-21 01:49:03,136 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:49:03,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:49:03,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1323122336, now seen corresponding path program 1 times [2022-07-21 01:49:03,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:49:03,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1028414038] [2022-07-21 01:49:03,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:49:03,137 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:49:03,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:49:03,138 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-21 01:49:03,140 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-21 01:49:03,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:49:03,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-21 01:49:03,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:49:03,315 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-21 01:49:03,316 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:49:03,316 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:49:03,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1028414038] [2022-07-21 01:49:03,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1028414038] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:49:03,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:49:03,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 01:49:03,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3375491] [2022-07-21 01:49:03,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:49:03,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 01:49:03,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:49:03,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 01:49:03,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 01:49:03,317 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 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-21 01:49:03,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:49:03,406 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-07-21 01:49:03,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 01:49:03,407 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 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-21 01:49:03,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:49:03,408 INFO L225 Difference]: With dead ends: 42 [2022-07-21 01:49:03,408 INFO L226 Difference]: Without dead ends: 25 [2022-07-21 01:49:03,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-21 01:49:03,409 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 14 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 16 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 01:49:03,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 84 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 16 Unchecked, 0.1s Time] [2022-07-21 01:49:03,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-07-21 01:49:03,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-07-21 01:49:03,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 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-21 01:49:03,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2022-07-21 01:49:03,412 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 25 [2022-07-21 01:49:03,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:49:03,412 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2022-07-21 01:49:03,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 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-21 01:49:03,412 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-07-21 01:49:03,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-21 01:49:03,413 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:49:03,413 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, 1, 1, 1] [2022-07-21 01:49:03,427 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-21 01:49:03,627 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-21 01:49:03,627 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:49:03,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:49:03,628 INFO L85 PathProgramCache]: Analyzing trace with hash 2065734315, now seen corresponding path program 1 times [2022-07-21 01:49:03,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:49:03,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1071505483] [2022-07-21 01:49:03,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:49:03,628 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:49:03,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:49:03,630 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-21 01:49:03,631 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-21 01:49:03,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:49:03,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-21 01:49:03,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:49:03,853 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-21 01:49:03,853 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:49:03,853 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:49:03,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1071505483] [2022-07-21 01:49:03,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1071505483] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:49:03,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:49:03,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-21 01:49:03,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151352273] [2022-07-21 01:49:03,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:49:03,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 01:49:03,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:49:03,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 01:49:03,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-21 01:49:03,855 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 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-21 01:49:03,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:49:03,988 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2022-07-21 01:49:03,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 01:49:03,989 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 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 28 [2022-07-21 01:49:03,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:49:03,989 INFO L225 Difference]: With dead ends: 25 [2022-07-21 01:49:03,989 INFO L226 Difference]: Without dead ends: 0 [2022-07-21 01:49:03,989 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2022-07-21 01:49:03,990 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 18 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 01:49:03,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 130 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 7 Unchecked, 0.0s Time] [2022-07-21 01:49:03,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-21 01:49:03,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-21 01:49:03,991 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-21 01:49:03,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-21 01:49:03,991 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2022-07-21 01:49:03,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:49:03,991 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-21 01:49:03,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 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-21 01:49:03,991 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-21 01:49:03,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-21 01:49:03,994 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-21 01:49:04,006 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-21 01:49:04,195 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-21 01:49:04,196 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-21 01:49:04,287 INFO L899 garLoopResultBuilder]: For program point __fpclassify_doubleFINAL(lines 25 50) no Hoare annotation was computed. [2022-07-21 01:49:04,287 INFO L902 garLoopResultBuilder]: At program point __fpclassify_doubleENTRY(lines 25 50) the Hoare annotation is: true [2022-07-21 01:49:04,287 INFO L899 garLoopResultBuilder]: For program point L38(lines 38 49) no Hoare annotation was computed. [2022-07-21 01:49:04,287 INFO L899 garLoopResultBuilder]: For program point L28-1(lines 28 33) no Hoare annotation was computed. [2022-07-21 01:49:04,287 INFO L895 garLoopResultBuilder]: At program point L28-2(lines 28 33) the Hoare annotation is: (= |__fpclassify_double_#in~x| __fpclassify_double_~x) [2022-07-21 01:49:04,287 INFO L899 garLoopResultBuilder]: For program point L28-3(lines 25 50) no Hoare annotation was computed. [2022-07-21 01:49:04,287 INFO L899 garLoopResultBuilder]: For program point __fpclassify_doubleEXIT(lines 25 50) no Hoare annotation was computed. [2022-07-21 01:49:04,288 INFO L899 garLoopResultBuilder]: For program point L45(lines 45 49) no Hoare annotation was computed. [2022-07-21 01:49:04,288 INFO L899 garLoopResultBuilder]: For program point L41(lines 41 49) no Hoare annotation was computed. [2022-07-21 01:49:04,288 INFO L895 garLoopResultBuilder]: At program point L56(line 56) the Hoare annotation is: (and (= |ULTIMATE.start_fmax_double_~x#1| (fp.neg (_ +zero 11 53))) (= (_ +zero 11 53) |ULTIMATE.start_fmax_double_~y#1|)) [2022-07-21 01:49:04,288 INFO L899 garLoopResultBuilder]: For program point L56-1(lines 56 57) no Hoare annotation was computed. [2022-07-21 01:49:04,288 INFO L899 garLoopResultBuilder]: For program point L65-1(lines 65 69) no Hoare annotation was computed. [2022-07-21 01:49:04,288 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-21 01:49:04,288 INFO L895 garLoopResultBuilder]: At program point L65-2(lines 65 69) the Hoare annotation is: (and (= |ULTIMATE.start_fmax_double_~x#1| (fp.neg (_ +zero 11 53))) |ULTIMATE.start_main_#t~short12#1| (= (_ +zero 11 53) |ULTIMATE.start_fmax_double_~y#1|) (= |ULTIMATE.start_main_~res~0#1| (_ +zero 11 53)) (= (_ +zero 11 53) |ULTIMATE.start_fmax_double_#res#1|) (= (_ +zero 11 53) |ULTIMATE.start___signbit_double_~x#1|)) [2022-07-21 01:49:04,288 INFO L899 garLoopResultBuilder]: For program point L65-3(lines 65 69) no Hoare annotation was computed. [2022-07-21 01:49:04,288 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-21 01:49:04,288 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-21 01:49:04,289 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 87) no Hoare annotation was computed. [2022-07-21 01:49:04,289 INFO L899 garLoopResultBuilder]: For program point L86(line 86) no Hoare annotation was computed. [2022-07-21 01:49:04,289 INFO L899 garLoopResultBuilder]: For program point L86-2(lines 86 89) no Hoare annotation was computed. [2022-07-21 01:49:04,289 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-21 01:49:04,289 INFO L902 garLoopResultBuilder]: At program point L91(lines 74 92) the Hoare annotation is: true [2022-07-21 01:49:04,289 INFO L899 garLoopResultBuilder]: For program point L87(line 87) no Hoare annotation was computed. [2022-07-21 01:49:04,289 INFO L895 garLoopResultBuilder]: At program point L54(line 54) the Hoare annotation is: (and (= |ULTIMATE.start_fmax_double_~x#1| (fp.neg (_ +zero 11 53))) (= (_ +zero 11 53) |ULTIMATE.start_fmax_double_~y#1|)) [2022-07-21 01:49:04,289 INFO L899 garLoopResultBuilder]: For program point L54-1(lines 54 55) no Hoare annotation was computed. [2022-07-21 01:49:04,289 INFO L895 garLoopResultBuilder]: At program point L71(lines 62 72) the Hoare annotation is: (and (= |ULTIMATE.start_fmax_double_~x#1| (fp.neg (_ +zero 11 53))) |ULTIMATE.start_main_#t~short12#1| (= (_ +zero 11 53) |ULTIMATE.start_fmax_double_~y#1|) (= (_ bv0 32) |ULTIMATE.start___signbit_double_#res#1|)) [2022-07-21 01:49:04,289 INFO L899 garLoopResultBuilder]: For program point L59(line 59) no Hoare annotation was computed. [2022-07-21 01:49:04,289 INFO L899 garLoopResultBuilder]: For program point L59-2(line 59) no Hoare annotation was computed. [2022-07-21 01:49:04,290 INFO L895 garLoopResultBuilder]: At program point L59-3(lines 52 60) the Hoare annotation is: (and (= |ULTIMATE.start_fmax_double_~x#1| (fp.neg (_ +zero 11 53))) (= (_ +zero 11 53) |ULTIMATE.start_fmax_double_~y#1|) (= (_ +zero 11 53) |ULTIMATE.start_fmax_double_#res#1|)) [2022-07-21 01:49:04,292 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:49:04,294 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-21 01:49:04,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 01:49:04 BoogieIcfgContainer [2022-07-21 01:49:04,306 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-21 01:49:04,307 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-21 01:49:04,307 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-21 01:49:04,307 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-21 01:49:04,307 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:48:58" (3/4) ... [2022-07-21 01:49:04,310 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-21 01:49:04,315 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __fpclassify_double [2022-07-21 01:49:04,319 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2022-07-21 01:49:04,319 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-07-21 01:49:04,319 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-21 01:49:04,319 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-21 01:49:04,340 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(x) == x [2022-07-21 01:49:04,341 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && ~Pluszero~LONGDOUBLE() == y) && ~Pluszero~LONGDOUBLE() == \result [2022-07-21 01:49:04,341 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && aux-res == 0.0 && __signbit_double(res) == 0-aux) && ~Pluszero~LONGDOUBLE() == y) && res == ~Pluszero~LONGDOUBLE()) && ~Pluszero~LONGDOUBLE() == \result) && ~Pluszero~LONGDOUBLE() == x [2022-07-21 01:49:04,342 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && aux-res == 0.0 && __signbit_double(res) == 0-aux) && ~Pluszero~LONGDOUBLE() == y) && 0bv32 == \result [2022-07-21 01:49:04,351 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-21 01:49:04,351 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-21 01:49:04,352 INFO L158 Benchmark]: Toolchain (without parser) took 7032.17ms. Allocated memory was 52.4MB in the beginning and 81.8MB in the end (delta: 29.4MB). Free memory was 29.7MB in the beginning and 53.2MB in the end (delta: -23.4MB). Peak memory consumption was 4.8MB. Max. memory is 16.1GB. [2022-07-21 01:49:04,352 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 52.4MB. Free memory was 33.6MB in the beginning and 33.5MB in the end (delta: 46.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 01:49:04,352 INFO L158 Benchmark]: CACSL2BoogieTranslator took 279.09ms. Allocated memory was 52.4MB in the beginning and 67.1MB in the end (delta: 14.7MB). Free memory was 29.5MB in the beginning and 49.4MB in the end (delta: -20.0MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. [2022-07-21 01:49:04,353 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.30ms. Allocated memory is still 67.1MB. Free memory was 49.3MB in the beginning and 47.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 01:49:04,353 INFO L158 Benchmark]: Boogie Preprocessor took 57.48ms. Allocated memory is still 67.1MB. Free memory was 47.7MB in the beginning and 46.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 01:49:04,353 INFO L158 Benchmark]: RCFGBuilder took 319.30ms. Allocated memory is still 67.1MB. Free memory was 46.2MB in the beginning and 34.0MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-21 01:49:04,353 INFO L158 Benchmark]: TraceAbstraction took 6276.17ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 33.6MB in the beginning and 56.6MB in the end (delta: -23.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 01:49:04,354 INFO L158 Benchmark]: Witness Printer took 44.63ms. Allocated memory is still 81.8MB. Free memory was 56.6MB in the beginning and 53.2MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 01:49:04,355 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.11ms. Allocated memory is still 52.4MB. Free memory was 33.6MB in the beginning and 33.5MB in the end (delta: 46.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 279.09ms. Allocated memory was 52.4MB in the beginning and 67.1MB in the end (delta: 14.7MB). Free memory was 29.5MB in the beginning and 49.4MB in the end (delta: -20.0MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.30ms. Allocated memory is still 67.1MB. Free memory was 49.3MB in the beginning and 47.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 57.48ms. Allocated memory is still 67.1MB. Free memory was 47.7MB in the beginning and 46.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 319.30ms. Allocated memory is still 67.1MB. Free memory was 46.2MB in the beginning and 34.0MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6276.17ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 33.6MB in the beginning and 56.6MB in the end (delta: -23.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 44.63ms. Allocated memory is still 81.8MB. Free memory was 56.6MB in the beginning and 53.2MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 87]: 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, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.2s, OverallIterations: 12, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 136 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 130 mSDsluCounter, 1068 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 92 IncrementalHoareTripleChecker+Unchecked, 718 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 155 IncrementalHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 350 mSDtfsCounter, 155 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 247 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=9, InterpolantAutomatonStates: 66, 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, 12 MinimizatonAttempts, 15 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 16 PreInvPairs, 23 NumberOfFragments, 62 HoareAnnotationTreeSize, 16 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 43 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 245 NumberOfCodeBlocks, 245 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 233 ConstructedInterpolants, 26 QuantifiedInterpolants, 800 SizeOfPredicates, 46 NumberOfNonLiveVariables, 891 ConjunctsInSsa, 89 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 42/42 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: 62]: Loop Invariant Derived loop invariant: ((x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && aux-res == 0.0 && __signbit_double(res) == 0-aux) && ~Pluszero~LONGDOUBLE() == y) && 0bv32 == \result - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: ((((x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && aux-res == 0.0 && __signbit_double(res) == 0-aux) && ~Pluszero~LONGDOUBLE() == y) && res == ~Pluszero~LONGDOUBLE()) && ~Pluszero~LONGDOUBLE() == \result) && ~Pluszero~LONGDOUBLE() == x - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 52]: Loop Invariant Derived loop invariant: (x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && ~Pluszero~LONGDOUBLE() == y) && ~Pluszero~LONGDOUBLE() == \result - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: \old(x) == x RESULT: Ultimate proved your program to be correct! [2022-07-21 01:49:04,390 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